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

From MaRDI portal
Revision as of 10:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cook reducibility is faster than Karp reducibility in NP
scientific article

    Statements

    title
    Cook reducibility is faster than Karp reducibility in NP (English)
    0 references
    author
    D. Kharzeev
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    reducibility
    0 references
    NP-complete sets
    0 references

    Identifiers

    zbMATH DE Number
    4178764
    0 references
    OpenAlex ID
    W1985343313
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q751812&oldid=37365848"
    Powered by MediaWiki