Splitting NP-Complete Sets.

Christian Glaßer Aduri Pavan Alan L. Selman Liyu Zhang

Published in: SIAM J. Comput. (2008)

Keyphrases

np complete
randomly generated
np hard
satisfiability problem
computational complexity
logical equivalence
constraint satisfaction problems
polynomially solvable
bounded treewidth
np complete problems
multiscale
phase transition
evolutionary algorithm
conjunctive queries
set theoretic