Inductive Counting for Width-Restricted Branching Programs

Information and Computation

Volumn 130, Issue 1, 1996, Pages 91-99

  Damm, Carsten ^a   Holzer, Markus ^b,c  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002397819     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0084     Document Type: Article

References (18)

1. 1, J. Comput. System Sci. 38, 150-164.
2. Barrington, D. A. M., and Immerman, N. (1994), personal communication.
3. Bédard, F., Lemieux, F., and McKenzie, P. (1993), Extensions to Barrington's M-program model, Theoret. Comput. Sci. 107, 31-61.
4. Borodin, A., Cook, S. A., Dymond, P. W., Ruzzo, W. L., and Tompa, M. (1989), Two applications of inductive counting for complementation problems, SIAM J. Comput. 18, 559-578.
5. Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J., (1981), Alternation, J. Assoc. Comput. Mach. 28, 114-133.
6. Damm, C., and Holzer, M. (1994), "Inductive Counting below Logspace," Forschungsbericht Mathematik/Informatik 94-12, Universität Trier, Trier, Germany.
7. Geffert, V. (1994), A hierarchy that does not collapse: Alternations in low level space, RAIRO - Inform. Theor. Appl. 28, 465-512.
8. Geffert, V. (1993), Tally versions of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space, SIAM J. Comput. 22, 102-113.
9. Ibarra, O., and Ravikumar, B. (1988), Sublogarithmic-space Turing machines, nonuniform space complexity, and closure properties, Math. Systems Theory 21, 1-17.
10. Immerman, N. (1988), Nondeterministic space is closed under complementation, SIAM J. Comput. 17, 935-938.
11. Karp, R. M., and Lipton, R. J. (1982), Turing machines that take advice, Enseign. Math. 28, 191-209.
12. Lange, K.-J. (1986), Two characterizations of the logarithmic alternation hierarchy, in "Proceedings of the 12th Conference on Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, No. 233, pp. 518-526, Springer-Verlag, Berlin/New York.
13. Liśkiewicz, M., and Reischuk, R. (1993), "The Sublogarithmic Space Hierarchy is Finite," Technical report, Technische Hochschule Darmstadt, Institut für Theoretische Informatik, Darmstadt.
14. Pudlák, P., and Žák, S. (1983), Space complexity of computations, preprint, Charles University, Prague.
15. Szelepcsényi, R. (1988), The method of forced enumeration for nondeterministic automata, Acta Informat. 26, 279-284.
16. Vinay, V. (1996), Hierarchies of circuit classes that are closed under complement, in "Conference on Computational Complexity" (formerly "Structure in Complexity"), to appear.
17. Von Braunmühl, B., Gengler, R., and Rettinger, R. (1993), The alternation hierarchy for sublogarithmic space is infinite, Comput. Complexity 3, 207-230.
18. Wagner, K. W. (1993), The alternation hierarchy for sublogarithmic space: An exciting race to STACS'93, in "Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, No. 665, pp. 2-4, Springer-Verlag, Berlin/New York.