Properties of NP-Complete Sets.

Christian Glaßer Aduri Pavan Alan L. Selman Samik Sengupta

Published in: SIAM J. Comput. (2006)

Keyphrases

np complete
logical equivalence
desirable properties
closed sets
structural properties
satisfiability problem
randomly generated
computational complexity
genetic algorithm
bayesian networks
pspace complete
np complete problems
np hard
database systems
sat problem
clustering algorithm
artificial intelligence