Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > SHIR BEN-ISRAEL:
All reports by Author Shir Ben-Israel:

TR10-068 | 15th April 2010
Shir Ben-Israel, Eli Ben-Sasson, David Karger

Breaking local symmetries can dramatically reduce the length of propositional refutations

This paper shows that the use of ``local symmetry breaking'' can dramatically reduce the length of propositional refutations. For each of the three propositional proof systems known as (i) treelike resolution, (ii) resolution, and (iii) k-DNF resolution, we describe families of unsatisfiable formulas in conjunctive normal form (CNF) that are ... more >>>




ISSN 1433-8092 | Imprint