Complexity lower bounds for approximation algebraic computation trees (Q1578509)

From MaRDI portal
Revision as of 18:37, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1253697)
scientific article
Language Label Description Also known as
English
Complexity lower bounds for approximation algebraic computation trees
scientific article

    Statements

    Complexity lower bounds for approximation algebraic computation trees (English)
    0 references
    0 references
    3 September 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate computations
    0 references
    0 references