For more about this, see How the Mind Works by Steven Pinker (W. W. Norton & Company, reissue edition, 2009)
The Fabric of Reality: The Science of Parallel Universes – and Its Implications (London: Penguin, 1998).,
R. Impagliazzo and A. Wigderson, P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of ACM Symposium on Theory of Computing (1997), pp. 220–229.
Are there interactive protocols for CO-NP languages?Information Processing Letters, 28:5 (1988), 249–51. and ,
Algebraic methods for interactive proof systems. Journal of the ACM, 39:4 (1992), 859–68., , , and ,
L. G. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 8:3 (1979), 410–421.
For nice proofs, see for example Lance Fortnow's “A Simple Proof of Toda's Theorem” (), or the book Gems of Theoretical Computer Science by Uwe Schöning (Springer, 1998)
IP = PSPACE. Journal of the ACM, 39:4 (1992), 869–77.,
A note on the circuit complexity of PP. Theoretical Computer Science, 347:1/2 (2005), 415–18.,
2006), pp. 340–54., Oracles are subtle but not malicious. In Proceedings of IEEE Conference on Computational Complexity (
Circuit lower bounds for Merlin–Arthur classes. SIAM Journal on Computing, 39:3 (2009), 1038–61.,
Algebrization: a new barrier in complexity theory. ACM Transactions on Computing Theory, 1:1 (2009), 2:1–54. and ,
Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17:1 (1984), 13–27., , and ,
Sigma_1^1-formulae on finite structures. Annals of Pure and Applied Logic, 24 (1983), 1–48..
Proceedings of ACM Symposium on Theory of Computing (New York: ACM, 1989), pp. 167–76., On the method of approximations. In
Proceedings of ACM Symposium on Theory of Computing (New York: ACM, 1987), pp. 77–82., Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In
Natural proofs. Journal of Computer and System Sciences, 55:1 (1997), 24–35. and ,
Number-theoretic constructions of efficient pseudo-random functions. Journal of the ACM, 51:2 (2004), 231–62. and ,
Proceedings of IEEE Conference on Computational Complexity (Silver Springs, MD: IEEE Computer Society Press, 2011), pp. 115–25., Non-uniform ACC circuit lower bounds. In
The GCT program toward the P vs. NP problem. Communications of the ACM, 55:6 (2012), 98–107,,
QIP = PSPACE. Journal of the ACM, 58:6 (2011), 30., , , and ,
Proceedings of Annual ACM Symposium on Theory of Computing (New York: ACM, 2000), pp. 608–17. and , Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In