computational complexity

, Volume 9, Issue 2, pp 123–145

A compendium of problems complete for symmetric logarithmic space

Authors

  • C. Alvarez
    • Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain, e-mail: alvarez@lsi.upc.es
  • R. Greenlaw
    • Department of Computer Science, Armstrong Atlantic State University, 11935 Abercorn Street, Savannah, Georgia 31410, USA, e-mail: greenlaw@pirates.armstrong.edu

DOI: 10.1007/PL00001603

Cite this article as:
Alvarez, C. & Greenlaw, R. Comput. complex. (2000) 9: 123. doi:10.1007/PL00001603

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.

Keywords. Completeness, SL, space complexity, symmetric logarithmic space.

Copyright information

© Birkhäuser Verlag, Basel 2000