Parameterized and subexponential-time complexity of satisfiability problems and applications.

Iyad A. Kanj Stefan Szeider

Published in: Theor. Comput. Sci. (2015)

Keyphrases

satisfiability problem
pspace complete
np complete
temporal logic
sat problem
search algorithm
phase transition
stochastic local search
stochastic local search algorithms
sat instances
computational complexity
special case
finite domain
mazurkiewicz traces