Diminishable parameterized problems and strict polynomial kernelization (Q5118456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 19:52, 5 March 2024

scientific article; zbMATH DE number 7244820
Language Label Description Also known as
English
Diminishable parameterized problems and strict polynomial kernelization
scientific article; zbMATH DE number 7244820

    Statements

    Diminishable parameterized problems and strict polynomial kernelization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 September 2020
    0 references
    0 references
    NP-hard problems
    0 references
    parameterized complexity
    0 references
    kernelization lower bounds
    0 references
    polynomial-time data reduction
    0 references
    exponential time hypothesis
    0 references