On the Computational Complexity of Combinatorial Problems (Q4087195)

From MaRDI portal
Revision as of 03:31, 29 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3506709
Language Label Description Also known as
English
On the Computational Complexity of Combinatorial Problems
scientific article; zbMATH DE number 3506709

    Statements

    title
    On the Computational Complexity of Combinatorial Problems (English)
    0 references
    published in
    Networks
    0 references
    publication date
    1975
    0 references
    author
    Richard M. Karp
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05-04
    0 references
    05C15
    0 references
    05C35
    0 references
    68Q25
    0 references
    05C10
    0 references
    90B10
    0 references
    zbMATH DE Number
    3506709
    0 references
    Wikidata QID
    Q56503916
    0 references
    OpenAlex ID
    W100926944
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4087195&oldid=39405080"
    Powered by MediaWiki