Exploring subexponential parameterized complexity of completion problems (Q2965491)
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 subexponential parameterized complexity of completion problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring subexponential parameterized complexity of completion problems |
scientific article |
Statements
3 March 2017
0 references
edge completion
0 references
modification
0 references
subexponential parameterized complexity
0 references
0.9941734671592712
0 references
