Pages that link to "Item:Q580175"
From MaRDI portal
The following pages link to On the complexity of cutting-plane proofs (Q580175):
Displayed 16 items.
- Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
- On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- Testing satisfiability of CNF formulas by computing a stable set of points (Q1777393) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
- Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Discretely ordered modules as a first-order extension of the cutting planes proof system (Q4254700) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)