On the Number of Additions to Compute Specific Polynomials

DOI10.1137/0205013MaRDI QIDQ4109195zbMATH OpenOpenAlexFDO

Authors Allan Borodin, Stephen 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

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(14)

• Lower bounds in algebraic computational complexity
• Lower bounds for polynomials with algebraic coefficients
• On the additive complexity of polynomials
• Complexity measures and hierarchies for the evaluation of integers and polynomials
• Evaluation of polynomials with super-preconditioning
• On the representation of rational functions of bounded complexity
• On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\).
• On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem
• Intersection multiplicity of a sparse curve and a low-degree curve
• A \(\tau \)-conjecture for Newton polygons
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
• On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials
• Some aspects of complexity in real algebraic geometry
• Shadows of Newton polytopes

This page was built for publication: On the Number of Additions to Compute Specific Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4109195)