Parameterized complexity of the workflow satisfiability problem (Q4689628)
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 6955775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of the workflow satisfiability problem |
scientific article; zbMATH DE number 6955775 |
Statements
Parameterized Complexity of the Workflow Satisfiability Problem (English)
0 references
16 October 2018
0 references
0 references
0 references
0 references
0 references
0 references
0.8496473431587219
0 references
0.8415250778198242
0 references
0.825508713722229
0 references
0.8243668079376221
0 references
0.8115041255950928
0 references
