Simplified Lower Bounds for Propositional Proofs

Notre Dame Journal of Formal Logic

Volumn 37, Issue 4, 1996, Pages 523-545

  Urquhart, Alasdair ^a   Fu, Xudong ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002842462     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1040046140     Document Type: Article

References (17)

1. Ajtai, M., “The complexity of the pigeonhole principle,” pp. 346-355 in Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, 1988.
2. Beame, P. “A switching lemma primer,” preprint, 1993.
3. Beame, P., R. Impagliazzo, J. Krajíček, T. Pitassi, P. Pudlák, and A. Woods, “Exponential lower bounds for the pigeonhole principle,” pp. 200-220 in Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, ACM Press, 1992.
4. Bellantoni, S., T. Pitassi, and A. Urquhart, “Approximation and small-depth Frege proofs,” SIAM Journal of Computing, vol. 21 (1992), pp. 1161-1179.
5. Chvátal, V., and E. Szemerédi, “Many hard examples for resolution,” Journal of the Association for Computing Machinery, vol. 35 (1988), pp. 759-768.
6. Cook, S. A., Resolution Lower Bound for Complete Graph Clauses, manuscript, University of Toronto, Toronto, 1993.
7. Furst, M., J. B. Saxe, and M. Sipser, “Parity, circuits, and the polynomial-time hierarchy,” pp. 260–270 in Proceedings of the 22nd Annual IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, 1981.
8. Frege, G., Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens, Nebert, Halle, 1879.
9. Håstad, J. T., Computational Limitations of Small-Depth Circuits, MIT Press, Cambridge, 1987.
10. Krajíek, J., P. Pudlák, and A. Woods, “Exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle,” Random Structures and Algorithms, vol. 7 (1995), pp. 15-39.
11. Von Neumann, J., “Zur Hilbertschen Beweistheorie,” Mathematische Zeitschrift, vol. 26 (1926), pp. 1-46.
12. Pitass, T., P. Beame, and R. Impagliazzo, “Exponential lower bounds for the pigeonhole principle,” Computational Complexity, vol. 3 (1993), pp. 97-140.
13. Razborov, A. A., “Bounded arithmetic and lower bounds in Boolean complexity,” pp. 344-386 in Feasible Mathematics II, edited by P. Clote and J. Remmel, Birkhäuser, Boston, 1995.
14. Shoenfield, J., Mathematical Logic, Addison-Wesley, Reading, 1967.
15. Tseitin, G. S., “On the complexity of derivation in propositional calculus,” pp. 115-125 in Studies in Constructive Mathematics and Mathematical Logic, Part 2, edited by A. O. Slisenko, 1970 (reprinted in Automation of Reasoning Vol. 2, edited by J. Siekmann and G. Wrightson, Springer-Verlag, New York, 1983, pp. 466-483).
16. Urquhart, A., “Hard examples for resolution,” Journal of the Association for Computing Machinery, vol. 34 (1987), pp. 209-219.
17. Yao, A., “Separating the polynomial-time hierarchy by oracles,” pp. 1-10 in Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, 1985.