A Compendium of Problems Complete for Symmetric Logarithmic Space (1996)
Cached
Download Links
- [www.cs.armstrong.edu]
- [ftp.eccc.uni-trier.de]
- [www.lsi.upc.es]
- DBLP
Other Repositories/Bibliography
| Venue: | Computational Complexity |
| Citations: | 12 - 0 self |
BibTeX
@ARTICLE{Alvarez96acompendium,
author = {Carme Alvarez and Raymond Greenlaw},
title = {A Compendium of Problems Complete for Symmetric Logarithmic Space},
journal = {Computational Complexity},
year = {1996},
volume = {9},
pages = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 nonintuitive. Our exposition helps make the class SL less mysterious and more accessible to other researchers. Key words. Completeness, SL, space complexity, symmetric logarithmic space. Subject classifications. 68Q17. 1. Introduction In this paper we describe problems that are logarithmic space many-one complete for symmetric logarithmic space (SL). Our hope in collecting these problems and extending this list is that more insight can be gained about the relationships between the complexity classes deterministic logarithmic space (DL), SL, and nondeterministic logarithmic space (NL). The symmetric Turing machine model introduced by Lewis & Papadimitriou ...
