Ajtai, M., The complexity of the pigeonhole principle, forthcoming; preliminary version, 29th Annual Symposium on the Foundations of Computer Science, pp. 346–355, 1988.
Alon, N. and Boppana, R., The monotone circuit complexity of Boolean functions, Combinatorica, vol. Vol 7, No. 1 (1987), pp. 1–22.
Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T., Pudlák, P., and Woods, A., Exponential lower bounds for the pigeonhole principle, Symposium on Theoretical Computer Science, 1992, pp. 200–221.
Beame, P. and Lawry, J., Randomized versus nondeterministic communication complexity, Symposium on Theoretical Computer Science, 1992, pp. 188–199.
Buss, S., Polynomial size proofs of the propositional pigeonhole principle, this Journal, vol. 52 (1987), pp. 916–927.
Buss, S. and Clote, P., Cutting planes, connectivity and threshold logic, to appear in Archive for Mathematical Logic.
Chvatal, V., Edmond polytopes and a hierarchy of combinatorial problems, Discrete Math., vol. 4 (1973), pp. 305–337.
Cook, S. and Haken, A., manuscript in preparation.
Cook, S. and Reckhow, R., The relative efficiency of propositional proof systems, this Journal, vol. 44 (1979), pp. 36–50.
Cook, W., Coullard, C. R., and Turan, G., On the complexity of cutting plane proofs, Discrete Applied Mathematics, vol. 18 (1987), pp. 25–38.
Goerdt, A., Cuttingplane versus Frege proof systems, Lecture Notes in Computer Science, vol. 533.
Gomory, R. E., An algorithm for integer solutions of linear programs, Recent advances in mathematical programming, McGraw-Hill, New York, 1963, pp. 269–302.
Haken, A., The intractability of resolution, Theoretical Computer Science, vol. 39 (1985), pp. 297–308.
Impagliazzo, R., Pitassi, T., and Urquhart, A., Upper and lower bounds for tree-like cutting planes proofs, Proceedings from Logic in Computer Science, 1994.
Karchmer, M., Communication complexity: A new approach to circuit depth, MIT Press, 1989.
Karchmer, M. and Wigderson, A., Monotone circuits for connectivity require super-logarithmic depth, Proceedings of the 20th STOC, 1988, pp. 539–550.
Krajíček, J., Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic, to appear in this Journal.
Krajíček, J., Lower bounds to the size of constant-depth propositional proofs, this Journal, vol. 59 (1994), no. 1, pp. 73–86.
Krajíček, J. and Pudlák, P., Some consequences of cryptographical conjectures for EF, manuscript, 1995.
Kushilevitz, E. and Nisan, N., Communication complexity, to appear.
Clote, P., Cutting planes and constant depth Frege proofs, manuscript, 1993.
Paris, J., Wilkie, A., and Woods, A., Provability of the pigeonhole principle and the existence of infinitely many primes, this Journal, vol. 53 (1988), no. 4, pp. 1235–1244.
Pudlák, P., manuscript in preparation.
Raz, R., Lower bounds for probabilistic communication complexity and for the depth of monotone Boolean circuits, Ph.D. thesis, The Hebrew University, 1992, in Hebrew.
Raz, R. and Wigderson, A., Probabilistic communication complexity of Boolean relations, Proceedings of the 30th FOCS, 1989, pp. 562–567.
Raz, R. and Wigderson, A., Monotone circuits for matching require linear depth, ACM Symposium on Theory of Computing, 1990, pp. 287–292.
Razborov, A., Lower bounds for the monotone complexity of some Boolean functions, Dokl. Ak. Nauk. SSSR, vol. 281 (1985), pp. 798–801, in Russian; English translation in Sov. Math. Dokl, vol. 31 (1985), pp. 354–357.
Razborov, A., Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic, Izvestiya of the R.A.N., vol. 59 (1995), no. 1, pp. 201–224.
Razborov, A. and Rudich, S., Natural proofs, Proceedings from the Twenty-sixth ACM Symposium on Theoretical Computer Science, 05 1994, pp. 204–213.
Yao, A. C.-C., Some complexity questions related to distributive computing, 11th Symposium on Theoretical Computer Science, 1979, pp. 209–213.