scientific article; zbMATH DE number 3533996
From MaRDI portal
zbMath0342.65031MaRDI QIDQ4110543
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05) Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)
Related Items
On square roots and their representations, Sieve algorithms for perfect power testing, Optimal solution of nonlinear equations, Une méthodologie du calcul hardware des fonctions élémentaires, Computing Chebyshev knot diagrams, Fast evaluation and root finding for polynomials with floating-point coefficients, Use of algebraically independent numbers for zero recognition of polynomial terms., Homotopy techniques for multiplication modulo triangular sets, New techniques for the computation of linear recurrence coefficients, The Borwein Brothers, Pi and the AGM, Fast computation of special resultants, On solving univariate sparse polynomials in logarithmic time, On the complexities of multipoint evaluation and interpolation, A simple and fast algorithm for computing exponentials of power series, Bibliography on the evaluation of numerical software, Unrestricted algorithms for reciprocals and square roots, Why does information-based complexity use the real number model?, Quantum random access stored-program machines, Is \(\pi\) normal ?, Learning Poisson binomial distributions
