Počet záznamů: 1

Complexity of Propositional Proofs Under a Promise

  1. 1.
    0343940 - MU-W 2011 RIV US eng J - Článek v odborném periodiku
    Dershowitz, N. - Tzameret, Iddo
    Complexity of Propositional Proofs Under a Promise.
    ACM Transactions on Computational Logic. Roč. 11, č. 3 (2010), s. 1-29 ISSN 1529-3785
    Výzkumný záměr: CEZ:AV0Z10190503
    Klíčová slova: theory * promise problems * propositional proof complexity * random 3CNF * resolution
    Kód oboru RIV: BA - Obecná matematika
    Impakt faktor: 1.391, rok: 2010
    http://dl.acm.org/citation.cfm?doid=1740582.1740586

    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.
    Trvalý link: http://hdl.handle.net/11104/0186297
    Název souboruStaženoVelikostKomentářVerzePřístup
    Tzameret1.pdf1248.6 KBVydavatelský postprintvyžádat