The Interface between P and NP in Signed CNF Formulas

  • Authors:

  • Affiliations:

  • Venue:
  • ISMVL '04 Proceedings of the 34th International Symposium on Multiple-Valued Logic
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 a NP-complete problem, and identify phase transition behavior in each of these problems.