Structural Complexity of AvgBPP

We study the class AvgBPP that consists of distributional problems which can be solved in average polynomial time (in terms of Levin's average-case complexity) by randomized algorithms with bounded error. We prove that there exists a distributional problem that is complete for AvgBPP under polynomial-time samplable distributions. Since we use deterministic reductions, the existence of a deterministic algorithm with average polynomial running time for our problem would imply AvgP = AvgBPP. Note that, while it is easy to construct a promise problem that is complete for $\bf promise\mbox{-}BPP$ [Mil01], it is unknown whether BPP contains complete languages . We also prove a time hierarchy theorem for AvgBPP (there are no known time hierarchy theorems for BPP). We compare average-case classes with their classical (worst-case) counterparts and show that the inclusions are proper.

[1]  Russell Impagliazzo,et al.  A personal view of average-case complexity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[2]  Moni Naor,et al.  On Robust Combiners for Oblivious Transfer and Other Primitives , 2005, EUROCRYPT.

[3]  Yuri Gurevich,et al.  Average Case Complexity ∗ , 1998 .

[4]  Boaz Barak,et al.  A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms , 2002, RANDOM.

[5]  Dmitry Itsykson.  Structural complexity of AvgBPP , 2010, Ann. Pure Appl. Log..

[6]  Lance Fortnow,et al.  Hierarchy theorems for probabilistic polynomial time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1988, Theor. Comput. Sci..

[8]  Dieter van Melkebeek,et al.  A Generic Time Hierarchy with One Bit of Advice , 2007, computational complexity.

[9]  Konstantin Pervyshev.  On Heuristic Time Hierarchies , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[10]  Marek Karpinski,et al.  Randomness, Provability, and the Seperation of Monte Carlo Time and Space , 1987, Computation Theory and Logic.

[11]  Oded Goldreich,et al.  On the Theory of Average Case Complexity , 1992, J. Comput. Syst. Sci..

[12]  Luca Trevisan,et al.  Average-Case Complexity , 2006, Found. Trends Theor. Comput. Sci..

[13]  Dima Grigoriev,et al.  A Complete Public-Key Cryptosystem , 2006, Groups Complex. Cryptol..

[14]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..