A probabilistic-time hierarchy theorem for “slightly non-uniform” algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 194-208

  Barak, Boaz ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MACHINERY; RANDOM PROCESSES;

COMPLETE PROBLEMS; COMPLEXITY MEASURES; NON-DETERMINISTIC TIME; NON-UNIFORM; PROBABILISTIC MACHINES; RUNNING TIME; TIME HIERARCHY;

TURING MACHINES;

EID: 84959053521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_16     Document Type: Conference Paper

References (12)

1. Karpinski, M., Verbeek, R.: Randomness, provability, and the separation of monte carlo time and space. In E. Börger, ed: Computation Theory and Logic. Volume 270 of LNCS. Springer (1987) 189-207.
2. Allender, E., Beigel, R., Hertrampf, U., Homer, S.: Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science 115 (1993) 225-241.
3. Cai, J.-Y., Nerurkar, A., Sivakumar, D.: Hardness and hierarchy theorems for probabilistic quasi-polynomial time. In ACM, ed.: Proceedings of the thirty-first annualACM Symposium on Theory of Computing: Atlanta, Georgia, May 1-4, 1999, New York, NY, USA, ACM Press (1999) 726-735
4. Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponentialcircuits: Derandomizing the XOR lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, ElPaso, Texas (1997) 220-229
5. Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, Boston, Massachusetts (1983) 330-335
6. Lautemann, C.: BPP and the polynomial hierarchy. Information Processing Letters 17 (1983) 215-217
7. Blum, M., Kannan, S.: Designing programs that check their work. Journal of the Association for Computing Machinery 42 (1995) 269-291
8. Babai, L., Fortnow, L., Lund, C.: Nondeterministic exponentialtime has two-prover interactive protocols. Computational Complexity 1 (1991) 3-40 (Preliminary version in Proc. 31st FOCS.).
9. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journalof the ACM 45 (1998) 70-122 Preliminary version in FOCS’ 92.
10. Levin, L.: Universal search problems (in russian). Problemy Peredachi Informatsii 9 (1973) 265-266 English translation in Trakhtenbrot, B. A.: A survey of Russian approaches to Perebor (brute-force search) algorithms. Annals of the History of Computing, 6 (1984), 384-400.
11. Schnorr, C. P.: Optimal algorithms for self-reducible problems. In Michaelson, S., Milner, R., eds.: Third International Colloquium on Automata, Languages and Programming, University of Edinburgh, Edinburgh University Press (1976) 322-337
12. Trevisan, L., Vadhan, S.: Pseudorandomness and average-case complexity via uniform reductions. In IEEE, ed.; Proceedings of 17th Conference on Computational Complexity, Montréal, Québec, May 21-24, IEEE (2002)