Tight lower bounds for certain parameterized NP-hard problems (Q2568440): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large FPT problems on coarse-grained parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing parallel hierarchies by reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-feature set problem is \(W[2]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum feature set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Revision as of 16:21, 10 June 2024

scientific article
Language Label Description Also known as
English
Tight lower bounds for certain parameterized NP-hard problems
scientific article

    Statements

    Tight lower bounds for certain parameterized NP-hard problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2005
    0 references

    Identifiers