Making nondeterminism unambiguous

SIAM Journal on Computing

Volumn 29, Issue 4, 2000, Pages 1118-1131

  Reinhardt, Klaus ^a   Allender, Eric ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONTEXT FREE LANGUAGES; GRAPH THEORY; LOGIC CIRCUITS; LOGIC GATES;

INDUCTIVE COUNTING TECHNIQUE; NONDETERMINISTIC LOGARITHMIC SPACE BOUNDED COMPUTATION; UNAMBIGUOUS COMPUTATION;

THEOREM PROVING;

EID: 0033725450     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798339041     Document Type: Article

References (43)

1. 0, and arithmetic circuits, in Proceedings 12th Annual IEEE Conference on Computational Complexity, 1997, pp. 134-148.
2. E. ALLENDER, R. BEALS, AND M. OGIHARA, The complexity of matrix rank and feasible systems of linear equations, in ACM Symposium on Theory of Computing (STOC), 1996.
3. C. ÁLVAREZ AND B. JENNER, A very hard log-space counting class, Theoret. Comput. Sci., 107 (1993), pp. 3-30.
4. 2 n/ log log n), Theory Comput. Syst., 31 (1998), pp. 539-550.
5. E. ALLENDER, Making computation count: Arithmetic circuits in the nineties, SIGACT News, 28 (1997), pp. 2-15.
6. E. ALLENDER AND M. OGIHARA, Relationships among PL, #L, and the determinant, RAIRO Theoret. Informat. Appl., 30 (1996), pp. 1-21.
7. E. ALLENDER AND K. REINHARDT, in Proceedings 13th Annual IEEE Conference on Computational Complexity, 1998, pp. 92-100.
8. E. ALLENDER, K. REINHARDT, AND S. ZHOU, Isolation, matching, and counting: Uniform and nonuniform upper bounds, J. Comput. System Sci.; a preliminary version appeared as [AR98], to appear.
9. A. BORODIN, S. A. COOK, P. W. DYMOND, W. L. Ruzzo, AND M. TOMPA, Two applications of inductive counting for complementation problems, SIAM J. Comput., 18 (1989), pp. 559-578.
10. R. BEIGEL AND B. FU, Circuits over PP and PL, in IEEE Conference on Computational Complexity, 1997, pp. 24-35.
11. G. BUNTROCK, B. JENNER, K.-J. LANGE, AND P. ROSSMANITH, Unambiguity and fewness for logarithmic space, in Proceedings 8th International Conference on Fundamentals of Computation Theory (FCT '91), Lecture Notes in Comput. Sci. 529, Springer-Verlag, New York, NY, 1991, pp. 168-179.
12. 1 computation, in Proceedings 11th Annual IEEE Conference on Computational Complexity, pp. 12-21.
13. #1?, Informatik-Prepri//nt 8, Fachbereich Informatik der Humboldt-Universität zu Berlin, 1991.
14. H. FERNAU, K.-J. LANGE, AND K. REINHARDT, Advocating ownership, in Proceedings 16th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 1180, V. Chandru, ed., Springer-Verlag, New York, NY, 1996, pp. 286-297.
15. L. FORTNOW, Private communication, University of Chicago, Chicago, IL, 1997.
16. A. GÁL, Semi-unbounded fan-in circuits: Boolean vs. arithmetic, in IEEE Structure in Complexity Theory Conference, IEEE, Piscataway, NJ, 1995, pp. 82-87.
17. J. GROLLMANN AND A. SELMAN, Complexity measures for public-key cryptosystems, SIAM J. Comput., 17 (1988), pp. 309-335.
18. A. GÁL AND A. WIGDERSON, Boolean vs. arithmetic complexity classes: Randomized reductions, Random Structures Algorithms, 9 (1996), pp. 99-111.
19. N. IMMERMAN, Nondeterministic space is closed under complementation, SIAM J. Comput., 17 (1988), pp. 935-938.
20. N. D. JONES, Space bounded reducibility among combinatorial problems, J. Comput. System Sci., 11 (1975), pp. 68-85.
21. R. KARP AND R. LIPTON, Turing machines that take advice, Enseign. Math., 28 (1982), pp. 191-209.
22. K.-J. LANGE, An unambiguous class possessing a complete set, in Proceedings 14th Symposium on Theoretical Aspects of Computer Science (STACS '97), Lecture Notes in Comput. Sci. 1200, Springer-Verlag, New York, 1997, pp. 339-350.
23. M. MAHAJAN AND V. VINAY, Determinant: Combinatorics, algorithms, and complexity, Chicago J. Theoret. Comput. Sci., 1997, available online at http://cs-www.uchicago.edu/publications/cjtcs.
24. K. MULMULEY, U. VAZIRANI, AND V. VAZIRANI, Matching is as easy as matrix inversion, Combinatorica, 7 (1987), pp. 105-113.
25. R. NlEDERMEIER AND P. ROSSMANITH, Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits, Inform. and Comput., 118 (1995), pp. 227-245.
26. N. NISAN AND A. WIGDERSON, Hardness vs. randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
27. M. OGIHARA, The PL hierarchy collapses, SIAM J. Comput., 27 (1998), pp. 1430-1437.
28. A. RAZBOROV, Lower bounds on the size of switching-and-rectifier networks for symmetric Boolean functions, Mathematical Notes of the Academy of Sciences of the USSR, 48 (1990), pp. 79-91.
29. A. RAZBOROV, Lower bounds for deterministic and nondeterministic branching programs, in Proceedings 8th International Conference on Fundamentals of Computation Theory (FCT '91), Lecture Notes in Comput. Sci. 529, Springer-Verlag, New York, 1992, pp. 47-60.
30. K. REGAN, Polynomials and combinatorial definitions of languages, in Complexity Theory Retrospective II, L. Hemaspaandra and A. Selman, eds., Springer-Verlag, New York, 1997, pp. 261-293.
31. P. ROSSMANITH AND W. RYTTER, Observations on log n time parallel recognition of unambiguous context-free languages, Inform. Process. Lett., 44 (1992), pp. 267-272.
32. W. RYTTER, Parallel time O(log n) recognition of unambiguous context-free languages, Inform. and Comput., 73 (1987), pp. 75-86.
33. I. H. SUDBOROUGH, A note on tape-bounded complexity classes and linear context-free languages, J. ACM, 22 (1975), pp. 499-500.
34. I. H. SUDBOROUGH, On the tape complexity of deterministic context-free languages, J. ACM, 25 (1978), pp. 405-414.
35. R. SZELEPCSÉNYI, The method of forced enumeration for nondeterministic automata, Acta Inform., 26 (1988), pp. 279-284.
36. S. TODA, Counting Problems Computationally Equivalent to the Determinant, Technical report CSIM 91-07, Department of Computer Science and Information Mathematics, University of Electro-Communications, Tokyo, 1991.
37. L. VALIANT, The relative complexity of checking and evaluating, Inform. Process. Lett., 5 (1976), pp. 20-23.
38. L. VALIANT, Why is Boolean complexity theory difficult?, in Boolean Function Complexity, M. Paterson, ed., London Math. Soc. Lecture Notes Ser. 169, Cambridge University Press, Cambridge, 1992, pp. 84-94.
39. H. VENKATESWARAN, Properties that characterize LOGCFL, J. Cornput. System Sci., 43 (1991), pp. 380-404.
40. H. VENKATESWARAN, Circuit definitions of nondeterministic complexity classes, SIAM J. Comput., 21 (1992), pp. 655-670.
41. V. VINAY, Counting auxiliary pushdown automata and semi-unbounded arithmetic, circuits, in Proceedings of the 6th Structure in Complexity Theory Conference, IEEE, Piscataway, NJ, 1991, pp. 270-284.
42. L. VALIANT AND V. VAZIRANI, NP is as easy as detecting unique solutions, Theoret. Comput. Sci., 47 (1986), pp. 85-93.
43. A. WIGDERSON, NL/poly ⊆ ⊖ L/poly, in Proceedings of the 9th IEEE Structure in Complexity Conference, IEEE, Piscataway, NJ, 1994, pp. 59-62.