Exercice 1 SAT is NP-complete Exercice 2 3-SAT is NP

Exercice 1 SAT is NP-complete Exercice 2 3-SAT is NP

1
SAT
Exercice 1
SAT is NP-complete
Exercice 2
3-SAT is NP-complete
Exercice 3
NAESAT is NP-complete ( Not All Equal SAT )
Exercice 4
3-COLORING is NP-complete.
Exercice 5
n-COLORING is NP-complete.
Exercice 6
ILP is NP-complete (Integer Linear Programming). Let {x1 , . . . , xn } = X be variables,
xi1,1 , . . . , xin,n ∈ X. Are they instanciations of x1 , . . . , xn in positive intergers such that the
inequations
– E1 : c1,1 xi1,1 + . . . + c1,n xi1,n ≥ b1
– ...
– En : cn,1 xin,1 + . . . + cn,n xin,n ≥ bn
are verified.
Exercice 7
Succint SAT is NEXP-complete.
Exercice 8
Domino NEXP-complete.
Exercice 9
FO2 on words NEXP-complete.
1