A completeness theory for polynomial (Turing) kernelization (Q2343083): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-014-9910-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-014-9910-8 / rank | |||
Normal rank | |||
Latest revision as of 02:39, 18 December 2024
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
