Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1007/PL00001603 | Electronic Colloquium on Computational Complexity |
Keywords | DocType | Volume |
Keywords. Completeness, SL, space complexity, symmetric logarithmic space. | Journal | 9 |
Issue | ISSN | Citations |
2 | 1420-8954 | 19 |
PageRank | References | Authors |
1.23 | 25 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Carme Àlvarez | 1 | 316 | 28.75 |
Raymond Greenlaw | 2 | 142 | 18.56 |