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

From MaRDI portal
Revision as of 05:30, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(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
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q751812&oldid=1024939"
      Powered by MediaWiki