Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis.

Peter Jonsson Victor Lagerkvist Gustav Nordh Bruno Zanuttini

Published in: SODA (2013)

Keyphrases

sat problem
decision problems
sat solvers
satisfiability problem
computational complexity
randomly generated
propositional satisfiability
sat solving
np complete
constraint satisfaction problems
davis putnam
special case
search strategy
random sat