An unambiguous class possessing a complete set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 339-350

  Lange, Klaus Jörn ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLETE PROBLEMS; LOGSPACE;

SEMANTICS;

EID: 84949662119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023471     Document Type: Conference Paper

References (20)

1. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal sequences and the complexity of maze problems. In Proc. of 20rd FOCS, pages 218-223, 1979.
2. 2 n/loglog n). In Proc. of the 17th ISAAC, 1996. In print.
3. C. Bennet. Time/Space trade-offs for reversible computation. SIAM J. Comp., 18:766-776, 1989.
4. G. Buntrock, B. Jenner, K.-J. Lange, and P. Rossmanith. Unambiguity and fewness for logarithmic space. In Proc. of the 8th Conference on Fundamentals of Computation Theory, number 529 in LNCS, pages 168-179, 1991.
5. Ka Wong Chong and Tak Wah Lam. Finding connected components in O(log n log log n) time on the EREW PRAM. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 11-20, 1993.
6. S. Cook. Deterministic CFLs are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Symp. on Theory of Computing, pages 338-345, 1979.
7. S. Cook. A taxonomy of problems with fast parallel algorithms. Inform, and Control, 64:2-22, 1985.
8. P. Dymond and W. Ruzzo. Parallel RAMs with owned global memory and deterministic context-free language recoginition. In Proc. of 13th International Colloquium on Automata, Languages and Programming, number 226 in LNCS, pages 95-104. Springer, 1986.
9. M. Fellows and N. Koblitz. Self-witnessing polynomial-time complexity and prime factorization. In Proc. of the 7th IEEE Structure in Complexity Conference, pages 107-110, 1992.
10. J. Hartmanis and L. Hemachandra. Complexity classes without machines: on complete languages for UP. Theoret. Comput. Sci., 58:129-142, 1988.
11. N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comp., 17:935-938, 1988.
12. M. Karchmer and A. Wigderson. On span programs. In Proc. of the 8th IEEE Structure in Complexity Theory Conference, pages 102-111, 1993.
13. W. Kowalczyk. Some connections between present ability of complexity classes and the power of formal systems of reasoning. In Proc. of 10th Symposium on Mathematical Foundations of Computer Science, number 201 in LNCS, pages 364-368. Springer, 1984.
14. P. Lewis and C.H. Papadimitriou. Symmetric space-bounded computation. Theoret. Comput. Sci., 19:161-187, 1982.
15. G. Miller. Riemann's hypothesis and tests for primality. J. Comp. System Sci., 13:300-317, 1976.
16. N. Nisan. RL ⊆ SC. In Proc. of the 24th Annual ACM Symposium on Theory of Computing, pages 619-623, 1992.
17. 1.5 n) space. In Proc. of 33th Annual IEEE Symposium on Foundations of Computer Science, pages 24-29, 1992.
18. 3/2). In Proc. of 36th FOCS, pages 344-353, 1995.
19. R. Szelepcsényi. The method of forcing for nondeterministic automata. Acta Informatica, 26:279-284, 1988.
20. A. Wigderson. NL/poly ⊆ ⊕L/poly. In Proc. of the 9th IEEE Structure in Complexity Conference, pages 59-62, 1994.