Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Linear gaps between degrees for the polynomial calculus modulo distinct primes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Linear lower bound on degrees of positivstellensatz calculus proofs for the parity
Theoretical Computer Science
Algebraic proof systems over formulas
Theoretical Computer Science - Logic and complexity in computer science
Lower Bounds for Polynomial Calculus: Non-Binomial Case
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower bounds for k-DNF resolution on random 3-CNFs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Towards Sharp Inapproximability For Any 2-CSP
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Lower bounds of static lovász-schrijver calculus proofs for tseitin tautologies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Sherali-adams relaxations of the matching polytope
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
Improving integrality gaps via Chvátal-Gomory rounding
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Hi-index | 0.00 |
The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one programs by the addition of new linear inequalities. We address the question of how many new inequalities are necessary to approximate certain combinatorial problems, and to solve certain instances of Boolean satisfiability. Our first result is a size/rank tradeoff for tree-like Lovász-Schrijver refutations, showing that any refutation that has small size also has small rank. This allows us to immediately derive exponential size lower bounds for tree-like refutations of many unsatisfiable systems of inequalities where prior to our work, only strong rank bounds were known. Unfortunately, we show that this tradeoff does not hold more generally for derivations of arbitrary inequalities. We give a very simple example showing that derivations can be very small but nonetheless require maximal rank. This rules out a generic argument for obtaining a size-based integrality gap from the corresponding rank-based integrality gap. Our second contribution is to show that a modified argument can often be used to prove size-based integrality gaps from rank-based integrality gaps. We apply this method to prove size-based integrality gaps for several prominant examples where prior to our work, only rank-based integrality gaps were known. Our third contribution is to prove new separation results. Using our machinery for converting rank-based lower bounds and integrality gaps into size-based lower bounds, we show that tree-like LS+ cannot polynomially simulate tree-like Cutting Planes, and that tree-like LS+ cannot polynomially simulate resolution. We conclude by examining size/rank tradeoffs beyond the LS systems. We show that for Shirali-Adams and Lasserre systems, size/rank tradeoffs continue to hold, even in the general (non-tree) case. A full version of this paper is available at the Electronic Colloquium on Computational Complexity [23].