Symbolic Computation and Complexity Theory Transcript of My Talk (Q2799547)

From MaRDI portal
Revision as of 19:13, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Symbolic Computation and Complexity Theory Transcript of My Talk
scientific article

    Statements

    title
    Symbolic Computation and Complexity Theory Transcript of My Talk (English)
    0 references
    author
    Erich L. Kaltofen
    0 references
    publication date
    12 April 2016
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    exponential-time algorithms
    0 references
    practicality
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W30
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6567218
    0 references
    OpenAlex ID
    W128943420
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2799547&oldid=36241112"
    Powered by MediaWiki