On the Complexity of k-SAT.

Russell Impagliazzo Ramamohan Paturi

Published in: J. Comput. Syst. Sci. (2001)

Keyphrases

satisfiability problem
data mining
phase transition
space complexity
real time
learning algorithm
computational complexity
np hard
scheduling problem
constraint satisfaction
search strategies
sat solvers