Translator Disclaimer
Fall 1996 Simplified Lower Bounds for Propositional Proofs
Xudong Fu, Alasdair Urquhart
Notre Dame J. Formal Logic 37(4): 523-544 (Fall 1996). DOI: 10.1305/ndjfl/1040046140

Abstract

This article presents a simplified proof of the result that bounded depth propositional proofs of the pigeonhole principle are exponentially large. The proof uses the new techniques for proving switching lemmas developed by Razborov and Beame. A similar result is also proved for some examples based on graphs.

Citation

Download Citation

Xudong Fu. Alasdair Urquhart. "Simplified Lower Bounds for Propositional Proofs." Notre Dame J. Formal Logic 37 (4) 523 - 544, Fall 1996. https://doi.org/10.1305/ndjfl/1040046140

Information

Published: Fall 1996
First available in Project Euclid: 16 December 2002

zbMATH: 0882.03052
MathSciNet: MR1446227
Digital Object Identifier: 10.1305/ndjfl/1040046140

Subjects:
Primary: 03F20
Secondary: 68Q25

Rights: Copyright © 1996 University of Notre Dame

JOURNAL ARTICLE
22 PAGES


SHARE
Vol.37 • No. 4 • Fall 1996
Back to Top