Strong partial clones and the time complexity of SAT problems.

Peter Jonsson Victor Lagerkvist Gustav Nordh Bruno Zanuttini

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

Keyphrases

sat problem
satisfiability problem
np complete
randomly generated
random sat
computational complexity
boolean satisfiability
decision problems
phase transition
sat solvers
propositional satisfiability
dynamic programming
max sat
sat instances
stochastic local search
information retrieval
learning algorithm