Relativized circuit complexity
Journal of Computer and System Sciences
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Structural complexity 1
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science
Perceptrons, PP, and the polynomial hierarchy
Computational Complexity - Special issue on circuit complexity
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 5.23 |
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.