Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial kernels and user reductions for the workflow satisfiability problem |
scientific article |
Statements
Polynomial kernels and user reductions for the workflow satisfiability problem (English)
0 references
7 September 2016
0 references
workflow satisfiability problem
0 references
parameterized complexity
0 references
kernelization
0 references
0 references
0 references
0 references
