Simplified Lower Bounds for Propositional Proofs

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. © 1996 by the University of Notre Dame. All rights reserved.