Simplified lower bounds for polynomials with algebraic coefficients

DOI10.1006/jcom.1997.0435zbMath0872.68051OpenAlexW2060363924MaRDI QIDQ1361874

Walter Baur

Publication date: 28 July 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1997.0435

zbMATH Keywords

nonscalar complexity of polynomials with algebraic coefficients

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Time-space tradeoffs in algebraic complexity theory ⋮ A new method to obtain lower bounds for polynomial evaluation

Cites Work

• Unnamed Item
• Some polynomials that are hard to compute
• Lower bounds for polynomials with algebraic coefficients
• Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
• On the intrinsic complexity of elimination theory
• Polynomials with Rational Coefficients Which are Hard to Compute
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

This page was built for publication: Simplified lower bounds for polynomials with algebraic coefficients