Cook reducibility is faster than Karp reducibility in NP (Q751812)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cook reducibility is faster than Karp reducibility in NP
scientific article

    Statements

    Cook reducibility is faster than Karp reducibility in NP (English)
    0 references
    0 references
    1990
    0 references
    0 references
    reducibility
    0 references
    NP-complete sets
    0 references
    0 references