Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for the workflow satisfiability problem engineered for counting constraints |
scientific article; zbMATH DE number 6641524
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the workflow satisfiability problem engineered for counting constraints |
scientific article; zbMATH DE number 6641524 |
Statements
Algorithms for the workflow satisfiability problem engineered for counting constraints (English)
0 references
20 October 2016
0 references
workflow satisfiability problem (WSP)
0 references
fixed-parameter tractability (FPT)
0 references
algorithm engineering
0 references
reduction to the pseudo-Boolean SAT problem
0 references
user-independent constraints
0 references
0 references
0 references
