A note on the complexity of approximative evaluation of polynomials

DOI10.1016/0020-0190(79)90131-5zbMath0414.68020OpenAlexW1973562897MaRDI QIDQ599498

Akihiro Nozaki

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90131-5

zbMATH Keywords

computational complexityapproximative evaluation of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

How many polynomials can be approximated faster than they can be evaluated? ⋮ Lower bound for the approximative complexity

Cites Work

• Unnamed Item
• Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
• On the computational power of pushdown automata
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

This page was built for publication: A note on the complexity of approximative evaluation of polynomials