Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
Lecture notes in computer science2006pp. 323–334
Citations Over TimeTop 10% of 2006 papers
Related Papers
- → On the number of steps in proofs(1989)28 cited
- → Depth of proofs, depth of cut-formulas and complexity of cut formulas(1994)13 cited
- → Some new upper bounds of ex(n;{C3,C4})(2017)1 cited
- On the five-color K_4 problem of the n -order complete graph(2004)
- → On Strong Normalization in Proof-Graphs for Propositional Logic(2016)