Skip to main content
SpringerLink
Log in

A compendium of problems complete for symmetric logarithmic space

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

The paper's main contributions are a compendium of problems that are complete for symmetric logarithmic space (SL), a collection of material relating to SL, a list of open problems, and an extension to the number of problems known to be SL-complete. Complete problems are one method of studying SL, a class for which programming is non-intuitive. Our exposition helps make the class SL less mysterious and more accessible to other researchers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain, e-mail: alvarez@lsi.upc.es , , , , , , ES

    C. Alvarez

  2. Department of Computer Science, Armstrong Atlantic State University, 11935 Abercorn Street, Savannah, Georgia 31410, USA, e-mail: greenlaw@pirates.armstrong.edu , , , , , , US

    R. Greenlaw

Authors
  1. C. Alvarez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Greenlaw
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: February 25, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alvarez, C., Greenlaw, R. A compendium of problems complete for symmetric logarithmic space. Comput. complex. 9, 123–145 (2000). https://doi.org/10.1007/PL00001603

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00001603

Search

Navigation