Paper Info
Title
Complexity of propositional proofs under a promise
Abstract
We study—within the framework of propositional proof complexity—the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where many stands for an explicitly specified function Λ in the number of variables n. To this end, we develop propositional proof systems under different measures of promises (i.e., different Λ) as extensions of resolution. This is done by augmenting resolution with axioms that, roughly, can eliminate sets of truth assignments defined by Boolean circuits. We then investigate the complexity of such systems, obtaining an exponential separation in the average case between resolution under different size promises: (1) Resolution has polynomial-size refutations for all unsatisfiable 3CNF formulas when the promise is &epsis;⋅2n, for any constant 0 (2) There are no subexponential size resolution refutations for random 3CNF formulas, when the promise is 2δ n, for any constant 0O(n3/2−&epsis;), for 0 “Goods Satisfactory or Money Refunded” —The Eaton Promise
Year
DOI
Venue
2007
10.1145/1740582.1740586
international colloquium on automata, languages and programming
Keywords
DocType
Volume
eaton promise,promise problems,propositional proof complexity,propositional proof system,cnf formula,random 3cnf,resolution,subexponential size resolution refutation,boolean circuit,different measure,goods satisfactory,augmenting resolution,different size promise,satisfiability,boolean circuits
Conference
11
Issue
ISSN
ISBN
3
ACM Transactions on Computational Logic, 11(3):1-29, 2010;
3-540-73419-8
Citations 
PageRank 
References 
0
0.34
13
Authors
2
Name
Order
Citations
PageRank
Nachum Dershowitz12818473.00
Iddo Tzameret2568.09