Login / Signup
The complexity of satisfiability problems: Refining Schaefer's theorem.
Eric Allender
Michael Bauland
Neil Immerman
Henning Schnoor
Heribert Vollmer
Published in:
J. Comput. Syst. Sci. (2009)
Keyphrases
</>
satisfiability problem
pspace complete
np complete
search algorithm
temporal logic
stochastic local search algorithms
phase transition
random sat
sat problem
stochastic local search
max sat
mazurkiewicz traces
model checking
constraint satisfaction
search strategies
solving hard