Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR14-118 | 9th September 2014 14:33

Narrow Proofs May Be Maximally Long

RSS-Feed




TR14-118
Authors: Albert Atserias, Massimo Lauria, Jakob Nordström
Publication: 9th September 2014 14:42
Downloads: 696
Keywords: 


Abstract:

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size n^O(w) is essentially tight. Moreover, our lower bound generalizes to polynomial calculus resolution (PCR) and Sherali-Adams, implying that the corresponding size upper bounds in terms of degree and rank are tight as well. Our results do not extend all the way to Lasserre, however, where the formulas we study have proofs of constant rank and size polynomial in both n and w.



ISSN 1433-8092 | Imprint