The complexity of computing the permanent (Q600247)

From MaRDI portal
Revision as of 12:02, 25 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/tcs/Valiant79, #quickstatements; #temporary_batch_1732532539753)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of computing the permanent
scientific article

    Statements

    title
    The complexity of computing the permanent (English)
    0 references
    publication date
    1979
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    permanent of a matrix
    0 references
    determinant
    0 references
    author
    Leslie G. Valiant
    0 references

    Identifiers

    zbMATH DE Number
    3646278
    0 references
    Wikidata QID
    Q55885263
    0 references
    OpenAlex ID
    W2006912660
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q600247&oldid=37929268"
    Powered by MediaWiki