Pages that link to "Item:Q4372903"

The following pages link to Lower bounds for cutting planes proofs with small coefficients (Q4372903):

Displaying 29 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)
• Mean-payoff games and propositional proofs (Q716324) (← links)
• Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
• Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
• Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
• Resolution over linear equations and multilinear proofs (Q952492) (← links)
• On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
• Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
• On semantic cutting planes with very small coefficients (Q1751424) (← links)
• Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← 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)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• The complexity of properly learning simple concept classes (Q2462500) (← links)
• Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)
• Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
• Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
• Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
• (Q5140848) (← links)
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
• Proof Complexity of Non-classical Logics (Q5894972) (← links)
• On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)