Abstract
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 n ≤ a(n) ≤ logn, and for every constant d≥ 1,
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Allender, E., Beigel, R., Hertrampf, U., Homer, S.: Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science 115 (1993) 225–241.
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–735
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–229
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
Lautemann, C.: BPP and the polynomial hierarchy. Information Processing Letters 17 (1983) 215–217
Blum, M., Kannan, S.: Designing programs that check their work. Journal of the Association for Computing Machinery 42 (1995) 269–291
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.).
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.
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.
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
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barak, B. (2002). A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms. In: Rolim, J.D.P., Vadhan, S. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 2002. Lecture Notes in Computer Science, vol 2483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45726-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-45726-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44147-2
Online ISBN: 978-3-540-45726-8
eBook Packages: Springer Book Archive