A compendium of problems complete for symmetric logarithmic space

Computational Complexity

Volumn 9, Issue 2, 2000, Pages 123-145

  Àlvarez, Carme ^a   Greenlaw, Raymond ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b Armstrong State University   (United States)

Author keywords

Completeness; SL; Space complexity; Symmetric logarithmic space

Indexed keywords

EID: 0034563805     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001603     Document Type: Article

References (38)

1. R. ALELIUNAS, R. M. KARP, R. J. LIPTON, L. LOVÁSZ, AND C. W. RACKOFF (1979). Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, IEEE, 218-223.
2. D. ANGLUIN (1982). Inference of reversible languages. J. Assoc. Comput. Mach. 29 742-765.
3. 4/3. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, 230-239.
4. G. BARNES AND W. L. RUZZO (1991). Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, New Orleans, LA 43-53.
5. G. BARNES AND W. L. RUZZO (1997). Undirected s-t connectivity in polynomial time and sublinear space. Computational Complexity 1, 1-28.
6. C. H. BENNETT (1989)., Time/space trade-offs for reversible computation. SIAM J. Comput. 18, 766-776.
7. A. BORODIN, S. A. COOK, P. W. DYMOND, W. L. RUZZO, AND M. TOMPA (1989). Two applications of inductive counting for complementation problems. SIAM J. Comput. 18, 559-578 (see also page 1283).
8. S. CHO AND D. HUYNH (1988). On a complexity hierarchy between L and NL. Inform. Process. Lett. 29, 177-182.
9. S. A. COOK (1985). A taxonomy of problems with fast parallel algorithms. Inform. and Control 64, 2-22.
10. S. A. COOK AND P. MCKENZIE (1987). Problems complete for deterministic logarithmic space. J. Algorithms 8, 385-394.
11. M. R. GAREY AND D. S. JOHNSON (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
12. P. C. GILMORE AND A. J. HOFFMAN (1964). A characterization of comparability graphs and of interval graphs. Canad. J. Math. 16, 539-548.
13. R. GREENLAW, H. J. HOOVER, AND W. L. RUZZO (1995). Limits to Parallel Computation: P-Completeness Theory. Oxford Univ. Press.
14. J. E. HOPCROFT AND J. D. ULLMAN (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
15. N. IMMERMAN (1987). Languages that capture complexity classes. SIAM J. Comput. 16, 760-778.
16. N. IMMERMAN (1988). Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935-938.
17. J. JA'JA' AND J. SIMON (1982). Parallel algorithms in graph theory: Planarity testing. SIAM J. Comput. 11, 314-328.
18. B. JENNER (1995). Knapsack problems for NL. Inform. Process. Lett. 54, 169-174.
19. D. S. JOHNSON (1990). A catalog of complexity classes. In Handbook of Theoretical Computer Science, ed. J. van Leeuwen, vol. A: Algorithms and Complexity, chapter 2, M.I.T. Press/Elsevier, 67-161.
20. N. D. JONES, Y. E. LIEN, AND W. T. LAASER (1976). New problems complete for nondeterministic log space. Math. Systems Theory 10, 1-17.
21. R. M. KARP (1972). Reducibility among combinatorial problems. In Complexity of Computer Computations, ed. R. E. Miller and J. W. Thatcher, Plenum Press, New York, 85-104.
22. K.-J. LANGE, P. MCKENZIE, AND A. TAPP (1997). Reversible space equals deterministic space. In Proceedings of the 12th Conference on Computational Complexity, Ulm, IEEE, 45-50.
23. H. R. LEWIS AND C. H. PAPADIMITRIOU (1982). Symmetric space-bounded computation. Theoret. Comput. Sci. 19, 161-187.
24. B. MONIEN AND I. H. SUDBOROUGH (1980). Formal language theory. In Formal Language Theory, ed. R. V. Book. Academic Press.
25. N. NISAN (1992) RL ⊆ SC. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, Victoria, B.C., 619-623.
26. N. NISAN AND A. TA-SHMA (1995). Symmetric logspace is closed under complement. Chicago J. Theoret. Comput. Sci. 1995, article 1 (electronic).
27. 1.5n) space. In Proceedings 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, IEEE, 24-29.
28. C. H. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley.
29. J.-E. PIN (1987). On the languages accepted by finite reversible automata. In Automata, Languages, and Programming: 14th International Colloquium, Berlin, Lecture Notes in Comput. Sci. 267, Springer-Verlag, 237-249.
30. J.-E. PIN (1992). On reversible automata. In Proceedings of the First LATIN Conference, Saõ-Paulo, Lecture Notes in Comput. Sci. 583, Springer-Verlag, 401-416.
31. A. A. RAZBOROV (1991), Lower bounds for deterministic and nondeterministic branching programs. In Fundamentals of Computation Theory: 8th International Conference, FCT '91, Gosen, ed. L. Budach, Lecture Notes in Computer Sci. 529, Springer-Verlag, 47-60.
32. J. H. REIF (1984). Symmetric complementation. J. Assoc. Comput. Mach. 31, 401-421.
33. W. L. RUZZO, J. SIMON, AND M. TOMPA (1984). Space-bounded hierarchies and probabilistic computations. J. Comput. System Sci. 28, 216-230.
34. I. A. STEWART (1991). Complete problems for symmetric logspace involving free groups. Inform. Process. Lett. 40, 263-267.
35. I. A. STEWART (1992). Refining known results on the generalized word problem for free groups. Internat. J. Algebra Comput. 2, 221-236.
36. R. SZELEPCSÉNYI (1988). The method of forced enumeration for nondeterministic automata. Acta Inform. 26, 279-284.
37. P. DE LA TORRE, R. GREENLAW, AND T. PRZYTYCKA (1992). Optimal tree ranking is in NC. Parallel Process. Lett. 2, 31-41.
38. P. DE LA TORRE, R. GREENLAW, AND A. A. SCHAFFER (1995). Optimal edge ranking of trees in polynomial time. Algorithmica 13, 592-618.