Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem.

Gregory Z. Gutin Stefan Kratsch Magnus Wahlström

Published in: Algorithmica (2016)

Keyphrases

satisfiability problem
np complete
temporal logic
phase transition
polynomial kernels
search algorithm
stochastic local search algorithms
sat problem
kernel function
stochastic local search
computational complexity
least squares
sat instances