A generic time hierarchy with one bit of advice

Computational Complexity

Volumn 16, Issue 2, 2007, Pages 139-179

  Van Melkebeek, Dieter ^a   Pervyshev, Konstantin ^b  

^a University of Wisconsin Madison   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Chinese remaindering; Depth of circuits; Identity testing; Rings

Indexed keywords

EID: 34249038974     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-007-0227-8     Document Type: Conference Paper

References (18)

1. S. ARORA & S. SAFRA (1998). Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1), 70-122.
2. B. BARAK (2002). A probabilistic time hierarchy theorem for slightly nonuniform algorithms. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, volume 2483 of Lecture Notes in Computer Science, 194-208. Springer-Verlag.
3. M. BLUM & S. KANNAN (1989). Designing Programs that Check their Work. In Proceedings of the 21st ACM Symposium on the Theory of Computing, 86-97.
4. S. COOK (1973). A hierarchy theorem for nondeterministic time complexity. Journal of Computer and System Sciences 7, 343-353.
5. L. FORTNOW & R. SANTHANAM (2004). Hierarchy theorems for probabilistic polynomial time. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, 316-324.
6. L. FORTNOW, R. SANTHANAM & L. TREVISAN (2005). Hierarchies for semantic classes. In Proceedings of the 37th ACM Symposium on the Theory of Computing, 348-355.
7. L. FORTNOW & M. SIPSER (1989). Probabilistic computation and linear time. In Proceedings of the 21st ACM Symposium on the Theory of Computing, 148-156.
8. L. FORTNOW & M. SIPSER (1997). Retraction of "Probabilistic computation and linear time". In Proceedings of the 29th ACM Symposium on the Theory of Computing, 750.
9. O. GOLDREICH, M. SUDAN & L. TREVISAN (2004). From logarithmic advice to single-bit advice. Technical Report TR-04-093, Electronic Colloquium on Computational Complexity.
10. D. GRIGORIEV, E. HIRSCH & K. PERVYSHEV (2005). Time hierarchies for cryptographic function inversion with advice. Technical Report TR-05-076, Electronic Colloquium on Computational Complexity.
11. J. HARTMANIS & R. STEARNS (1965). On the Computational Complexity of Algorithms. Transactions of the American Mathematical Society 117, 285-306.
12. R. KARP & R. LIPTON (1982). Turing machines that take advice. L'Enseignement Mathématique 28(2), 191-209. A preliminary version appeared in STOC 1980.
13. L. LEVIN (1973). Universal Search Problems. Problems of Information Transmission 9(3), 265-266. In Russian.
14. C. PAPADIMITRIOU (1994). On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48, 498-532.
15. K. PERVYSHEV (2005). Time Hierarchies for Computations with a Bit of Advice. Technical Report TR-05-054, Electronic Colloquium on Computational Complexity.
16. R. RETTINGER & R. VERBEEK (2001). Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. In Proceedings of the 13th International Sympsoium on Fundamentals of Computation Theory, 311-322. Springer-Verlag.
17. J. SEIFERAS, M. FISCHER & A. MEYER (1978). Separating Nondeterministic Time Complexity Classes. Journal of the ACM 25, 146-167.
18. S. ŽÀK (1983). A Turing machine time hierarchy. Theoretical Computer Science 26, 327-333.