On the computational hardness based on linear fpt-reductions (Q2498987)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational hardness based on linear fpt-reductions
scientific article

    Statements

    On the computational hardness based on linear fpt-reductions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2006
    0 references
    fpt-reduction
    0 references
    Linear
    0 references
    Hardness
    0 references
    Complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers