An Alternative proof of SAT NP-Completeness

Bruno Escoffier (1) , Vangelis Th. Paschos (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

We give a proof of SAT's NP-completeness based upon a syntaxic characterization of NP given by Fagin at 1974. Then, we illustrate a part of our proof by giving examples of how two well-known problems, MAX INDEPENDENT SET and 3- COLORING, can be expressed in terms of CNF. Finally, in the same spirit we demonstrate the min NPO-completeness of MIN WSAT under strict reductions.

Mots clés: second order logic; NP-completeness; reductions; second order logic.

Bruno Escoffier, Vangelis Th. Paschos. An Alternative proof of SAT NP-Completeness. pp.10, 2004. ⟨hal-00017602⟩