Abstract
We apply the inductive counting technique to nondeterministic branching programs and prove that complementation on this model can be done without increasing the width of the branching programs too much. This shows that for an arbitrary space bound s(n), the class of languages accepted by nonuniform nondeterministic O(s(n)) space bounded Turing machines is closed under complementation. As a consequence we obtain for arbitrary space bounds s(n) that the alternation hierarchy of nonuniform O(s(n)) space bounded Turing machines collapses to its first level. This improves the previously known result of Immerman [6] and Szelepcsényi [12] to space bounds of order o(log n) in the nonuniform setting.
This reveals a strong difference to the relations between the corresponding uniform complexity classes, since very recently it has been proved that in the uniform case the alternating space hierarchy does not collapse for sublogarithmic space bounds [3, 5, 9].
Partially supported by the Deutsche Forschungsgemeinschaft grant DFG La 618/1-1.
Preview
Unable to display preview. Download preview PDF.
References
David A. Mix Barrington. Bounded width polynomial size branching programs can recognize exactly those languages in NC 1. Journal of Computer and Systems Sciences, 38:150–164, 1989.
Allen Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, and Martin Tompa. Two applications of inductive counting for complementation problems. SIAM Journal on Computing, 18:559–578, 1989.
Burchard von Braunmühl, Romain Gengler, and Robert Rettinger. The alternation hierarchy for sublogarithmic space is infinite. Computational Complexity, 3:207–230, 1993.
Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM, 28:114–133, 1981.
Villiam Geffert. A hierarchy that does not collapse: Alternations in low level space. RAIRO — Theoretical Informatics and Applications, to appear.
Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935–938, 1988.
Richard M. Karp and Richard J. Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28:191–209, 1982.
K.-J. Lange. Two characterizations of the logarithmic alternation hierarchy. In Proceedings of the 12th Conference on Mathematical Foundations of Computer Science, number 233 in LNCS, pages 518–526. Springer, August 1986.
Maciej Liśkiewicz and Rüdiger Reischuk. The sublogarithmic space hierarchy is infinite. Technical report, Technische Hochschule Darmstadt, Institut für Theoretische Informatik, Darmstadt, January 1993.
David Mix Barrington and Neil Immerman. Personal communication, 1994.
Rüdiger Reischuk. Personal communication, 1994.
Robert Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damm, C., Holzer, M. (1994). Inductive counting below logspace. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_74
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive