How many polynomials can be approximated faster than they can be evaluated?

DOI10.1016/0020-0190(81)90006-5zbMath0467.68045OpenAlexW2011428209MaRDI QIDQ1155959

Claus Peter Schnorr

Publication date: 1981

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

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

zbMATH Keywords

algebraic complexityarithmetic complexityevaluation of polynomialsapproximation of polynomialscanonical computationlower bounds on arithmetic complexityuniversal fieldsZariski- closed setsZariski-topology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Real and complex fields (12D99)

Cites Work

• A note on the complexity of approximative evaluation of polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How many polynomials can be approximated faster than they can be evaluated?