• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

An Alternative proof of SAT NP-Completeness

Thumbnail
Date
2004
Publisher city
Paris
Collection title
Annales du LAMSADE
Dewey
Recherche opérationnelle
Sujet
NP-completeness; reductions; second order logic.
URI
https://basepub.dauphine.fr/handle/123456789/5998
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Paschos, Vangelis
Escoffier, Bruno
Type
Document de travail / Working paper
Item number of pages
207-213
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.