ABSTRACT
We show that for any constant a, ZPP/b(n) strictly contains ZPTIME(na)/b(n) for some b(n) = O(log n log log n). Our techniques are very general and give the same hierarchy for all common semantic time classes including RTIME, NTIME ∩ coNTIME, UTIME, MATIME, AMTIME and BQTIME.We show a stronger hierarchy for RTIME: For every constant c, RP/1 is not contained in RTIME(nc)/(log n)1/2c. To prove this result we first prove a similar statement for NP by building on Zák's proof of the nondeterministic time hierarchy.
- Allender, E., Beigel, R., Hertrampf, U., and Homer, S. Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science 115, 2 (19 July 1993), 225--241. Google ScholarDigital Library
- Balcázar, J. L., Díaz, J., and Gabarró, J. Structural Complexity 1. Springer-Verlag, New York, NY, 1988. Google ScholarDigital Library
- Balcázar, J. L., Díaz, J., and Gabarró, J. Structural Complexity 2. Springer-Verlag, New York, NY, 1990. Google ScholarDigital Library
- Barak, B. A probabilistic-time hierarchy theorem for "Slightly Non-uniform" algorithms. Lecture Notes in Computer Science 2483 (2002), 194--208. Google ScholarDigital Library
- Cook, S. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151--158. Google ScholarDigital Library
- Cook, S. A hierarchy for nondeterministic time complexity. In Conference Record, Fourth Annual ACM Symposium on Theory of Computing (Denver, Colorado, 1--3 May 1972), pp. 187--192. Google ScholarDigital Library
- Fortnow, L., and Santhanam, R. Hierarchy theorems for probabilistic polynomial time. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (2004), pp. 316--324. Google ScholarDigital Library
- Goldreich, O., Sudan, M., and Trevisan, L. From logarithmic advice to single-bit advice. Electronic Colloquium on Computational Complexity, TR04-093 (2004).Google Scholar
- Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. (AMS) 117 (1965), 285--306.Google ScholarCross Ref
- Kabanets, V., and Impagliazzo, R. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13, 1-2 (2004), 1--46. Google ScholarDigital Library
- Karp, R., and Lipton, R. Turing machines that take advice. L'Enseignement Mathématique 28, 2 (1982), 191--209.Google Scholar
- Karpinski, M., and Verbeek, R. On the monte carlo space constructible functions and separation results for probabilistic complexity classes. Information and Computation 75 (1987). Google ScholarDigital Library
- Levin, L. Universal search problems(in russian). Problemy Peredachi Informatsii 9, 3 (1973), 265--266.Google Scholar
- Papadimitriou, C. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48, 3 (1994), 498--532. Google ScholarDigital Library
- Sipser, M. On relativization and the existence of complete sets. In Proceedings of 9th International Colloquium on Automata, Languages and Programming (1982), pp. 523--531. Google ScholarDigital Library
- Zák, S. A Turing machine time hierarchy. Theoretical Computer Science 26, 3 (Oct. 1983), 327--333.Google ScholarCross Ref
Index Terms
Hierarchies for semantic classes
Recommendations
A tight Karp-Lipton collapse result in bounded arithmetic
Cook and Krajíček have recently obtained the following Karp-Lipton collapse result in bounded arithmetic: if the theory PV proves NP⊆ P/poly, then the polynomial hierarchy collapses to the Boolean hierarchy, and this collapse is provable in PV. Here we ...
Proof systems that take advice
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow J. Symbolic Logic, 1979], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as ...
Comments