scientific article; zbMATH DE number 3433440
From MaRDI portal
Publication:5184360
zbMath0275.65013MaRDI QIDQ5184360
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Roundoff error (65G50) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Numerical linear algebra (65F99) Algorithms in computer science (68W99)
Related Items (3)
On the additive complexity of specific polynomials ⋮ Selection of good algorithms from a family of algorithms for polynomial derivative evaluation ⋮ A new upper bound on the complexity of derivative evaluation
This page was built for publication:
