Number of the records: 1
Complexity of Propositional Proofs Under a Promise
- 1.
SYSNO ASEP 0343940 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Complexity of Propositional Proofs Under a Promise Author(s) Dershowitz, N. (IL)
Tzameret, Iddo (MU-W) SAISource Title ACM Transactions on Computational Logic. - : Association for Computing Machinery - ISSN 1529-3785
Roč. 11, č. 3 (2010), s. 1-29Number of pages 29 s. Language eng - English Country US - United States Keywords theory ; promise problems ; propositional proof complexity ; random 3CNF ; resolution Subject RIV BA - General Mathematics CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000277925300004 EID SCOPUS 77952800429 DOI 10.1145/1740582.1740586 Annotation We study-within the framework of propositional proof complexity-the problem of certifying un-satisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where many stands for an explicitly specified function Lambda in the number of variables n. To this end, we develop propositional proof systems under different measures of promises (i. e., different Lambda) as extensions of resolution. This is done by augmenting resolution with axioms that, roughly, can eliminate sets of truth assignments defined by Boolean circuits. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2011
Number of the records: 1