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.

Citations

242	The Intractability of Resolution - Haken - 1985
190	Bounded arithmetic, propositional logic, and complexity theory - Krajíček - 1995
169	Outline of an algorithm for integer solutions to linear programs - Gomory - 1958
123	Edmonds polytopes and a hierarchy of combinatorial problems - Chvátal - 1973
121	Lower bounds for the monotone complexity of some boolean functions - Razborov - 1985
117	Exponential lower bounds for the pigeonhole principle - Beame, Impagliazzo, et al. - 1992
116	The monotone circuit complexity of boolean functions - Alon, Boppana - 1987
109	The complexity of the pigeonhole principle - Ajtai - 1988
74	Three uses of Herbrand-Gentzen theorem in relating model theory and proof theory - Craig - 1955
74	Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic - Krajícek - 1997
71	Lower Bounds for Cutting Planes Proofs with Small Coefficients - Bonet, Pitassi, et al. - 1997
71	reasoning. A new form of the Herbrand-Gentzen theorem - Craig - 1957
69	Provability of the pigeonhole principle and the existence of infinitely many primes, JSL 53 - Paris, Wilkie, et al. - 1988
67	Some consequences of cryptographic conjectures for S 1 2 and EF - Krajíček, Pudlák - 1995
51	Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic - Razborov - 1995
48	Lower bounds to the size of constant-depth propositional proofs - Krajíček - 1994
39	On the complexity of cutting plane proofs - Cook, Coullard, et al. - 1987
39	Upper and lower bounds on tree-like cutting planes proofs - IMPAGLIAZZO, PITASSI, et al. - 1994
8	A lower bound on the number of additions in monotone computations, Theor - Schnorr - 1976
4	Cutting planes, connectivity, and threshold logic, Archive for Math. Logic - Buss, Clote
3	Some linear programming aspects of combinatorics - Chvátal - 1975
3	The Complexity of Boolean Functions, Teubner and - Wegener - 1987
2	On the complexity of Cutting Plane proofs, Discrete Applied Mathematics 18 - Tur'an - 1987
1	Counting bottlenecks to show monotone P 6 - Haken - 1995
1	On cutting planes, in: Combinatorics 79, part II, Annals of Discrete - Schrijver