Login / Signup
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
Eric Allender
Michael Bauland
Neil Immerman
Henning Schnoor
Heribert Vollmer
Published in:
Electron. Colloquium Comput. Complex. (2004)
Keyphrases
</>
satisfiability problem
pspace complete
np complete
phase transition
search algorithm
temporal logic
computational complexity
stochastic local search
solving hard
stochastic local search algorithms
random sat
mazurkiewicz traces
sat problem
knowledge base
decision problems
finite domain