Lower bounds for resolution and cutting plane proofs and monotone computations
Pavel Pudlák · Journal of Symbolic Logic · 1997
Abstract We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for monotone circuits to circuits which compute with real numbers and use nondecreasing functions as gates. The latter result is of independent interest, since, in particular, it implies an exponential lower bound for some arithmetic circuits.