Login / Signup
On Problems as Hard as CNF-SAT.
Marek Cygan
Holger Dell
Daniel Lokshtanov
Dániel Marx
Jesper Nederlof
Yoshio Okamoto
Ramamohan Paturi
Saket Saurabh
Magnus Wahlström
Published in:
Computational Complexity Conference (2012)
Keyphrases
</>
sat solving
propositional satisfiability
sat solvers
decision problems
data sets
search algorithm
evolutionary algorithm
scheduling problem
optimization problems
np complete
normal form
sat instances
genetic algorithm
learning algorithm
objective function
constraint programming