Pages that link to "Item:Q580175"

The following pages link to On the complexity of cutting-plane proofs (Q580175):

Displaying 50 items.

• Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
• Cutting planes cannot approximate some integer programs (Q453048) (← links)
• The complexity of recursive constraint satisfaction problems (Q636283) (← links)
• Cutting planes and the parameter cutwidth (Q693047) (← links)
• Reverse split rank (Q896287) (← links)
• Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
• On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
• On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
• A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
• On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
• On semantic cutting planes with very small coefficients (Q1751424) (← links)
• Testing satisfiability of CNF formulas by computing a stable set of points (Q1777393) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)
• Cutting-plane proofs in polynomial space (Q1813835) (← links)
• Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
• Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
• On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
• How QBF expansion makes strategy extraction hard (Q2096438) (← links)
• On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
• On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
• Constrained pseudo-propositional logic (Q2228353) (← 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)
• Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
• Achieving consistency with cutting planes (Q2687054) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
• Space Complexity in Polynomial Calculus (Q2944568) (← links)
• Cutting Planes and the Parameter Cutwidth (Q3576046) (← 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)
• (Q4625701) (← links)
• (Q4625702) (← links)
• Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
• (Q4993273) (← links)
• (Q5020979) (← links)
• Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
• (Q5092485) (← links)
• Simplifying clausal satisfiability problems (Q5096298) (← links)
• (Q5140848) (← links)
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)