On some FPT problems without polynomial Turing compressions (Q2072079)
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 7467480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some FPT problems without polynomial Turing compressions |
scientific article; zbMATH DE number 7467480 |
Statements
On some FPT problems without polynomial Turing compressions (English)
0 references
1 February 2022
0 references
Turing compression
0 references
Turing kernelization
0 references
parameterized complexity
0 references
compression
0 references
kernelization
0 references
0 references
0 references
0 references
0 references
0.793322741985321
0 references
0.7904067039489746
0 references
0.7779970765113831
0 references
0.7758886814117432
0 references
0.7702259421348572
0 references
