@inproceedings{27ef32782bd440feb7882aa7da96eac4,
title = "Lower bounds of static lov{\'a}sz-schrijver calculus proofs for tseitin tautologies",
abstract = "We prove an exponential lower bound on the size of static Lov{\'a}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.",
author = "Arist Kojevnikov and Dmitry Itsykson",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11786986\_29",
language = "English",
isbn = "3540359044",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "323--334",
booktitle = "Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings",
address = "Germany",
note = "33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 ; Conference date: 10-07-2006 Through 14-07-2006",
}