Complexity lower bounds for approximation algebraic computation trees (Q1578509): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970197763 / rank
 
Normal rank

Revision as of 00:03, 20 March 2024

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
    0 references
    3 September 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate computations
    0 references
    0 references
    0 references