Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis.
Gregory Z. GutinMagnus WahlströmPublished in: Inf. Process. Lett. (2016)
Keyphrases
- lower bound
- satisfiability problem
- upper bound
- max sat
- np complete
- temporal logic
- np hard
- average case complexity
- branch and bound algorithm
- search algorithm
- phase transition
- branch and bound
- sat problem
- stochastic local search algorithms
- stochastic local search
- optimal solution
- worst case
- objective function
- weighted max sat
- vc dimension
- sat instances
- pspace complete
- mazurkiewicz traces
- decision procedures
- directed acyclic graph
- belief revision
- model checking
- presburger arithmetic