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 lower bound on degrees of positivstellensatz calculus proofs for the parity
Theoretical Computer Science
Lower Bounds for Polynomial Calculus: Non-Binomial Case
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
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
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
| Hi-index | 0.00 |
We prove an exponential lower bound on the size of static Lovász-Schrijver calculus refutations of Tseitin tautologies. We use several techniques, namely, translating static LS+ proof into Positivstellensatz proof of Grigoriev et al., extracting a “good” expander out of a given graph by removing edges and vertices of Alekhnovich et al., and proving linear lower bound on the degree of Positivstellensatz proofs for Tseitin tautologies.