The Parameterized Complexity of the Unique Coverage Problem (Q5387796): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination can be hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank

Latest revision as of 09:55, 28 June 2024

scientific article; zbMATH DE number 5279485
Language Label Description Also known as
English
The Parameterized Complexity of the Unique Coverage Problem
scientific article; zbMATH DE number 5279485

    Statements

    Identifiers