Abstract
We present an a.e. complexity hierarchy for nondeterministic time, and show that it is essentially the best result which can be proved using relativizable proof techniques.
Supported in part by National Science Foundation Research Initiation Grant number CCR-8810467. Some of this research was performed while the author was a visiting professor at Institut für Informatik, Universität Würzburg. D-8700 Würzburg, Federal Republic of Germany.
Supported in part by the National Science Foundation under grants CCR-8808949 and CCR-8958528. Work done in part while at the Johns Hopkins University.
Supported in part by National Science Foundation grants number MIP-8608137 and CCR-8814339, National Security Agency grant number MDA904-87-H, and a Fulbright-Hays research fellowship. Some of this research was performed while the author was a Guest Professor at Mathematisches Institut, Universität Heidelberg.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Balcázar and U. Schöning, Bi-immune sets for complexity classes, Mathematical Systems Theory 18, 1–10.
G. Buntrock, Logarithmisch platzbeschränkte Simulationen, Dissertation, Technische Universität Berlin.
S. Cook, A hierarchy for nondeterministic time complexity, Journal of Computer and System Sciences 7, 343–353.
S. Cook and R. Reckhow, Time-bounded random access machines, Journal of Computer and System Sciences 7, 354–375.
L. Fortnow and M. Sipser, Probabilistic computation and linear time, Proc. 21st IEEE FOCS Conference, pp. 148–156.
M. Fürer, Data structures for distributed counting, Journal of Computer and System Sciences 28, 231–243.
J. Geske, D. Huynh, and A. Selman, A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees, Proc. 4th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 247, Springer Verlag, Berlin, pp. 125–135.
J. Geske, D. Huynh, and J. Seiferas, A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes, Technical Report, University of Rochester.
J. Hartmanis and R. Stearns, On the computational complexity of algorithms, Transactions of the AMS 117, 285–306.
F. Hennie and R. Stearns, Two-tape simulation of multitape Turing machines, J. ACM 13, 533–546.
M. Karpinski and R. Verbeek, Randomness, provability, and the separation of Monte Carlo time and space, Lecture Notes in Computer Science 270, pp. 189–207.
T. Long, Strong nondeterministic polynomial-time reductions, Theoretical Computer Science 21, 1–25.
C. Rackoff and J. Seiferas, Limitations on separating nondeterministic complexity classes, SIAM J. Comp. 10, 742–745.
R. Verbeek, personnal communication.
S. Zák, A Turing machine hierarchy, Theoretical Computer Science 26, 327–333.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allender, E., Beigel, R., Hertrampf, U., Homer, S. (1990). A note on the almost-everywhere hierarchy for nondeterministic time. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-52282-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52282-9
Online ISBN: 978-3-540-46945-2
eBook Packages: Springer Book Archive