A. Atserias , Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms. Theoretical Computer Science, vol. 295 (2003), no. 1–3, pp. .
A. Atserias , On sufficient conditions for unsatisfiability of random formulas. Journal of the ACM, vol. 51 (2004), no. 2, pp. 281–311.
A. Atserias , M.L. Bonet , and J.L. Esteban , Lower bounds for the weak pigeonhole principle and random formulas beyond resolution. Information and Computation, vol. 176 (2002), no. 2, pp. 136–152.
D. A. M. Barrington , N. Immerman , and H. Straubing , On uniformity within NC. Journal of Computer and System Sciences, vol. 41 (1990), no. 3, pp. 274–306.
E. Ben-Sasson and N. Galesi , Space complexity of random formulae in resolution. Random Structures and Algorithms, vol. 23 (2003), no. 1, pp. 92–109.
E. Ben-Sasson and A. Wigderson , Short proofs are narrow – resolution made simple. Journal of the ACM, vol. 48 (2001), no. 2, pp. 149–169.
B. Bollobás , Random Graphs, second edition, Cambridge University Press, Cambridge, UK, 2001.
S. R. Buss , First-Order Proof Theory of Arithmetic, Handbook of Proof Theory ( S. R. Buss , editor), Elsevier, 1998, pp. 79–147.
M. L. Furst , J. B. Saxe , and M. Sipser , Parity, circuits, and the polynomial-time hierarchy, Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (FOCS ′81), pp. 260–270, IEEE Computer Society, Washington, DC, 1981.
A. Haken , The intractability of resolution, Theoretical Computer Science, vol. 39 (1985), no. 2–3, pp. 297–308.
J. Krajíček , Bounded Arithmetic, Propositional Logic, and Complexity Theory, Encyclopedia of Mathematics and its Applications, vol. 60, Cambridge University Press, New York, 1995.
J. Krajíček , On the weak pigeonhole principle. Fundamenta Mathematicae, vol. 170 (2001), no. 1–3, pp. 123–140.
J. Krajíček , Combinatorics of first order structures and propositional proof systems. Archive for Mathematical Logic, vol. 43 (2004), no. 4, pp. 427–441.
J. Krajíček , P. Pudlák , and A. Woods , An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures & Algorithms, vol. 7 (1995), no. 1, pp. 15–39.
A. Maciel , T. Pitassi , and A. R. Woods , A new proof of the weak pigeonhole principle. Journal of Computer and System Sciences, vol. 64 (2002), no. 4, pp. 843–872.
J.B. Paris and A.J. Wilkie , Counting problems in bounded arithmetic, Methods in Mathematical Logic, Lecture Notes in Mathematics, vol. 1130, pp. 317–340, 1985.
P. Pudlák , Proofs as games, American Mathematical Monthly, vol. 107, no. 6, pp. 541–550, 2000.
R. Raz , Resolution lower bounds for the weak pigeonhole principle. Journal of the ACM, vol. 51 (2004), no. 2, pp. 115–138.
A. A. Razborov , Pseudorandom generators hard for k-DNF resolution and polynomial calculus, Annals of Mathematics, vol. 181 (2015), no. 2, pp. 415–472.
S. Riis , A complexity gap for tree-resolution. Computational Complexity, vol. 10 (2001), pp. 179–209.
H. Robbins , A remark on Stirling’s formula. The American Mathematical Monthly, vol. 62 (1955), no. 1, pp. 26–29.
N. Segerlind , S. R. Buss , and R. Impagliazzo , A switching lemma for small restrictions and lower bounds for k-DNF resolution. SIAM Journal on Computing, vol. 33 (2004), no. 5, pp. 1171–1200.
E. Viola , On approximate majority and probabilistic time. Computational Complexity, vol. 18 (2009), no. 3, pp. 337–375.
E. Viola , Randomness Buys Depth for Approximate Counting. Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS ′11), IEEE Society Press, Palm Springs, CA, pp. 230–239, 2011.