Pages that link to "Item:Q2938473"
From MaRDI portal
The following pages link to Iterative Plan Construction for the Workflow Satisfiability Problem (Q2938473):
Displaying 7 items.
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
- On the satisfiability of authorization requirements in business process (Q1712553) (← links)
- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints (Q3452559) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- On the Workflow Satisfiability Problem with Class-independent Constraints (Q5363761) (← links)