Login / Signup
Algorithms for the workflow satisfiability problem engineered for counting constraints.
David A. Cohen
Jason Crampton
Andrei V. Gagarin
Gregory Z. Gutin
Mark Jones
Published in:
CoRR (2015)
Keyphrases
</>
satisfiability problem
stochastic local search
stochastic local search algorithms
np complete
temporal logic
computational complexity
upper bound
optimization problems
combinatorial optimization
decision problems
combinatorial problems
solving hard