The parameterized complexity landscape of two-sets cut-uncut (Q6864004)
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 8154792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity landscape of two-sets cut-uncut |
scientific article; zbMATH DE number 8154792 |
Statements
The parameterized complexity landscape of two-sets cut-uncut (English)
0 references
4 February 2026
0 references
fixed-parameter tractability
0 references
polynomial kernels
0 references
W[1]-hardness
0 references
XP
0 references
para-NP-hardness
0 references
