On the Number of Additions to Compute Specific Polynomials
From MaRDI portal
Publication:4109195
DOI10.1137/0205013zbMath0341.65034OpenAlexW2091278332MaRDI QIDQ4109195
Allan Borodin, Stephen A. Cook
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205013
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)
Related Items
On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\)., Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications, Shadows of Newton polytopes, Lower bounds for polynomials with algebraic coefficients, On the additive complexity of polynomials, On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials, On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem, Some aspects of complexity in real algebraic geometry, Complexity measures and hierarchies for the evaluation of integers and polynomials, Evaluation of polynomials with super-preconditioning, Intersection multiplicity of a sparse curve and a low-degree curve, On the representation of rational functions of bounded complexity, A \(\tau \)-conjecture for Newton polygons, Lower bounds in algebraic computational complexity
