Many hard examples for resolution
Journal of the ACM (JACM)
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
Communication complexity
A machine program for theorem-proving
Communications of the ACM
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Linear lower bound on degrees of positivstellensatz calculus proofs for the parity
Theoretical Computer Science
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Rank Bounds and Integrality Gaps for Cutting Planes Procedures
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
SIAM Journal on Computing
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Linear Level Lasserre Lower Bounds for Certain k-CSPs
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Integrality gaps for Sherali-Adams relaxations
Proceedings of the forty-first annual ACM symposium on Theory of computing
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Multiparty Communication Complexity and Threshold Circuit Size of AC^0
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
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
ACM SIGACT News
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
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
SIAM Journal on Computing
Hi-index | 0.00 |
We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proof systems -- tree resolution -- into formulas that require large rank in very strong proof systems, including any proof system that manipulates polynomials of degree at most k (known as Th(k) proofs). These include high degree versions of Lovasz-Schrijver and Cutting Planes proofs. We introduce two very general families of these proof systems, denoted Tcc(k) and Rcc(k). The proof lines of Tcc(k) are arbitrary Boolean functions, each of which can be evaluated by an efficient k-party randomized communication protocol. Tcc(k) proofs include Th(k-1) proofs as a special case. Rcc(k) proofs generalize Tcc(k) proofs and require only that each inference be checkable by a short k-party protocol. For all k in O(loglog n), our main results are as follows: First, any unsatisfiable CNF formula of high resolution rank can be efficiently transformed into another CNF formula requiring high rank in all Rcc(k) systems, and exponential tree size in all Tcc(k) systems. Secondly, there are strict rank hierarchies for all Rcc(k) systems, and strict tree-size hierarchies for all Tcc(k) systems. Finally, we apply our general method to give optimal integrality gaps for low rank Rcc(2) proofs for MAX-2t-SAT, which imply optimal integrality gaps for low rank Cutting Planes and Th(1) proofs.