Evaluation of polynomials with super-preconditioning

DOI10.1016/0022-0000(78)90041-7zbMath0369.68031OpenAlexW2040034237MaRDI QIDQ1243131

Richard J. Lipton, Larry J. Stockmeyer

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90041-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ On the additive complexity of polynomials ⋮ Lower bounds for the complexity of polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bound on the multiplicative efficiency of iteration
• Yu. V. Linnik's works in number theory
• On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions
• On the Number of Additions to Compute Specific Polynomials
• Polynomials with Rational Coefficients Which are Hard to Compute
• On the number of multiplications necessary to compute certain functions
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials