Complexity lower bounds for approximation algebraic computation trees (Q1578509)

From MaRDI portal
Revision as of 00:03, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    Dima Yu. Grigoriev
    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
    OpenAlex ID
    W1970197763
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1578509&oldid=32303125"
    Powered by MediaWiki