34th International Symposium on Multiple-Valued Logic (ISMVL'04)
The Interface between P and NP in Signed CNF Formulas
University of Toronto, Toronto, Canada
May 19-May 22
ISBN: 0-7695-2130-4
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 a NP-complete problem, and identify phase transition behavior in each of these problems.
Citation:
C. Ansótegui, R. Béjar, A. Cabiscol, F. Manyà, "The Interface between P and NP in Signed CNF Formulas," ismvl, pp.251-256, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004