Polynomial kernels and user reductions for the workflow satisfiability problem (Q2946020)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6482359
| 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; zbMATH DE number 6482359 |
Statements
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem (English)
0 references
15 September 2015
0 references
0.9954180717468262
0 references
0.8119389414787292
0 references
0.8012757301330566
0 references
0.7996188998222351
0 references
0.7993732690811157
0 references
