Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis.
Gregory Z. GutinMagnus WahlströmPublished in: CoRR (2015)
Keyphrases
- lower bound
- satisfiability problem
- upper bound
- max sat
- np complete
- search algorithm
- np hard
- stochastic local search algorithms
- average case complexity
- phase transition
- temporal logic
- branch and bound
- branch and bound algorithm
- worst case
- optimal solution
- objective function
- pspace complete
- sat problem
- stochastic local search
- weighted max sat
- randomly generated
- sat instances
- decision procedures
- computational complexity