Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799)
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: Polynomial kernels and user reductions for the workflow satisfiability problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9954180717468262
0 references
0.820681095123291
0 references
0.8075202703475952
0 references
0.806877613067627
0 references
0.8015954494476318
0 references
