A taxonomy of problems with fast parallel algorithms (Q3694688)

From MaRDI portal
Revision as of 03:17, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/iandc/Cook85, #quickstatements; #temporary_batch_1731462974821)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A taxonomy of problems with fast parallel algorithms
scientific article

    Statements

    title
    A taxonomy of problems with fast parallel algorithms (English)
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    uniform Boolean circuit families
    0 references
    reducibility
    0 references
    parallel greedy algorithm
    0 references
    author
    Stephen A. Cook
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W99
    0 references
    68Q25
    0 references
    03D60
    0 references
    zbMATH DE Number
    3919816
    0 references
    Wikidata QID
    Q55891722
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3694688&oldid=37893991"
    Powered by MediaWiki