Complexity lower bounds for approximation algebraic computation trees (Q1578509)

From MaRDI portal
Revision as of 21:31, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57733282, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
Complexity lower bounds for approximation algebraic computation trees
scientific article

    Statements

    title
    Complexity lower bounds for approximation algebraic computation trees (English)
    0 references
    author
    Felipe Cucker
    0 references
    Q198260
    0 references
    publication date
    3 September 2000
    0 references
    Mathematics Subject Classification ID
    68W30
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    1499173
    0 references
    zbMATH Keywords
    approximate computations
    0 references
    Wikidata QID
    Q57733282
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1578509&oldid=15053201"
    Powered by MediaWiki