A completeness theory for polynomial (Turing) kernelization (Q2343083)
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: A completeness theory for polynomial (Turing) kernelization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A completeness theory for polynomial (Turing) kernelization |
scientific article |
Statements
A completeness theory for polynomial (Turing) kernelization (English)
0 references
4 May 2015
0 references
parameterized complexity
0 references
kernelization
0 references
Turing kernelization
0 references
complexity hierarchies
0 references
0 references
0 references
