More on BPP and the Polynomial-Time Hierarchy

  title={More on BPP and the Polynomial-Time Hierarchy},
  author={Ran Canetti},
  journal={Inf. Process. Lett.},

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 27 extracted citations

On Approximate Majority and Probabilistic Time

computational complexity • 2009
View 7 Excerpts
Highly Influenced

Enumerations of the Kolmogorov Function

Electronic Colloquium on Computational Complexity • 2004
View 9 Excerpts
Highly Influenced

S2p is subset of ZPPNP

J. Comput. Syst. Sci. • 2007
View 5 Excerpts
Highly Influenced

The 1-Versus-2 Queries Problem Revisited

Theory of Computing Systems • 2007
View 4 Excerpts
Highly Influenced

Oblivious Symmetric Alternation

View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…