Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications.

Iyad A. Kanj Stefan Szeider

Published in: COCOA (2014)

Keyphrases

satisfiability problem
pspace complete
np complete
search algorithm
phase transition
temporal logic
solving hard
stochastic local search
computational complexity
sat problem
max sat
stochastic local search algorithms
mazurkiewicz traces
multi agent systems
finite domain
graph coloring problems