A note on the circuit complexity of PP

In this short note, we show that for any integer k, there are languages in the complexity class PP that do not have Boolean circuits of size nk.

[1]  Nikolai K. Vereshchagin.  On The Power of PP , 1992, Computational Complexity Conference.

[2]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

[3]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[4]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[5]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[6]  N. K. Vereschchagin.  On the power of PP , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[7]  Scott Aaronson,et al.  Oracles are subtle but not malicious , 2005, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[8]  J. Cai,et al.  S^p _2 \subseteq ZPP^{NP} , 2001, FOCS 2001.

[9]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[10]  Mitsunori Ogihara,et al.  Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy , 1992, SIAM J. Comput..

[11]  Ravi Kannan,et al.  Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..

[12]  Richard Beigel.  Perceptrons, PP, and the polynomial hierarchy , 2005, computational complexity.

[13]  Lance Fortnow,et al.  Arithmetization: A new method in structural complexity theory , 2005, computational complexity.

[14]  Vikraman Arvind,et al.  If NP has Polynomial-Size Circuits, then MA=AM , 1995, Theor. Comput. Sci..

[15]  Christopher B. Wilson.  Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[16]  Carsten Lund,et al.  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  J. Köbler,et al.  New Collapse Consequences of NP Having Small Circuits , 1999, SIAM J. Comput..

[18]  Uwe Schöning.  Probabilistic Complexity Classes and Lowness , 1989, J. Comput. Syst. Sci..

[19]  U. Schoning.  Probalisitic complexity classes and lowness , 1989 .

[20]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[21]  José L. Balcázar,et al.  Structural complexity 1 , 1988 .