On the parameterized complexity of short computation and factorization (Q1387097)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the parameterized complexity of short computation and factorization
scientific article

    Statements

    On the parameterized complexity of short computation and factorization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 June 1998
    0 references
    parameterized computational complexity
    0 references
    parameterized computations of Turing machines
    0 references
    nondeterministic machine
    0 references
    derivations
    0 references
    factorizations
    0 references
    hardness
    0 references
    completeness
    0 references
    \(W\) hierarchy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references