On some FPT problems without polynomial Turing compressions (Q2072079)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On some FPT problems without polynomial Turing compressions
scientific article

    Statements

    On some FPT problems without polynomial Turing compressions (English)
    0 references
    0 references
    1 February 2022
    0 references
    Turing compression
    0 references
    Turing kernelization
    0 references
    parameterized complexity
    0 references
    compression
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers