A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms

  • Boaz Barak
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2483)


Unlike other complexity measures such as deterministic and nondeterministic time and space, and non-uniform size, it is not known whether probabilistic time has a strict hierarchy. For example, as far as we know it may be that BPP is contained in the class BPtime(n). In fact, it may even be that the class BPtime(n logn ) is contained in the class BPtime(n).

In this work we prove that a hierarchy theorem does hold for “slightly non-uniform” probabilistic machines. Namely, we prove that for every function a:ℕ→ℕ where log log na(n) ≤ logn, and for every constant d≥ 1,
$$ BPtime(n^d )_{/a(n)} \mathop \subset \limits_ \ne BPP_{/a(n)} $$
here BPtime(t(n))/a(n) is defined to be the class of languages that are accepted by probabilistic Turing machines of running time t(n) and description size a(n). We actually obtain the stronger result that the class BPP/loglogn is not contained in the class BPtime(n d)/logn for every constant d ≥ 1.

We also discuss conditions under which a hierarchy theorem can be proven for fully uniform Turing machines. In particular we observe that such a theorem does hold if BPP has a complete problem.


Turing Machine Complete Problem Universal Turing Machine Probabilistic Machine Promise Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.Google Scholar
  2. 2.
    Allender, E., Beigel, R., Hertrampf, U., Homer, S.: Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science 115 (1993) 225–241.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 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 annual ACM Symposium on Theory of Computing: Atlanta, Georgia, May 1-4, 1999, New York, NY, USA, ACM Press (1999) 726–735CrossRefGoogle Scholar
  4. 4.
    Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas (1997) 220–229Google Scholar
  5. 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–335Google Scholar
  6. 6.
    Lautemann, C.: BPP and the polynomial hierarchy. Information Processing Letters 17 (1983) 215–217zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Blum, M., Kannan, S.: Designing programs that check their work. Journal of the Association for Computing Machinery 42 (1995) 269–291zbMATHGoogle Scholar
  8. 8.
    Babai, L., Fortnow, L., Lund, C.: Nondeterministic exponential time has two-prover interactive protocols. Computational Complexity 1 (1991) 3–40 (Preliminary version in Proc. 31st FOCS.).zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45 (1998) 70–122 Preliminary version in FOCS’ 92.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 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.Google Scholar
  11. 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–337Google Scholar
  12. 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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Boaz Barak
    • 1
  1. 1.Department of Computer ScienceWeizmann Institute of ScienceRehovotIsrael

Personalised recommendations