Exploring the subexponential complexity of completion problems (Q2828210)
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: Exploring the subexponential complexity of completion problems |
scientific article; zbMATH DE number 6642908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring the subexponential complexity of completion problems |
scientific article; zbMATH DE number 6642908 |
Statements
24 October 2016
0 references
edge completion
0 references
modification
0 references
subexponential parameterized complexity
0 references
0 references
0 references
0 references
0 references
0 references
Exploring the subexponential complexity of completion problems (English)
0 references
0.9941734671592712
0 references
0.822753369808197
0 references
