The interface between P and NP in signed CNF formulas

Author

Ansótegui, C. ; Béjar, R. ; Cabiscol, A. ; Manyà, F.

Author_Institution

Dept. of Comput. Sci., Univ. de Lleida, Spain

fYear

2004

fDate

19-22 May 2004

Firstpage

251

Lastpage

256

Abstract

We first define a new class of signed CNF formulas and prove that its satisfiability problem is NP-complete. We then study in detail the interface between P and NP in two many-valued satisfiability problems: Mono+pPartiallySigned-2SAT and Regular+pSigned-2SAT. We show that such problems smoothly interpolate between P and NP by mixing together a polynomial and an NP-complete problem, and identify phase transition behavior in each of these problems.

Keywords

combinatorial mathematics; communicating sequential processes; computability; computational complexity; polynomials; CSP formalisms; Mono+pPartiallySigned-2SAT; NP-complete satisfiability problems; Regular+pSigned-2SAT; SAT solvers; combinatorial problems; constraint satisfaction formalisms; many-valued satisfiability problems; polynomial problems; problem phase transition behavior; propositional satisfiability; signed CNF formula P/NP interface; signed-SAT; Artificial intelligence; Computer interfaces; Computer languages; Computer science; Encoding; Hardware; Machinery; Multivalued logic; NP-complete problem; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on

ISSN

0195-623X

Print_ISBN

0-7695-2130-4

Type

conf

DOI

10.1109/ISMVL.2004.1319950

Filename

1319950