Perfect Code is \(W[1]\)-complete (Q1603518): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of short computation and factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation Models for Parameterized Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold dominating sets and an improved characterization of \(W[2]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501141 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:48, 4 June 2024

scientific article
Language Label Description Also known as
English
Perfect Code is \(W[1]\)-complete
scientific article

    Statements

    Perfect Code is \(W[1]\)-complete (English)
    0 references
    0 references
    14 July 2002
    0 references
    Computational complexity
    0 references
    Parameterized computational complexity
    0 references
    Perfect Code
    0 references
    Weighted Exact Conjunctive Normal Form Satisfiability
    0 references
    W[1]-completeness
    0 references

    Identifiers