Lower bounds for polynomials with algebraic coefficients
Open Access
- 31 July 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 11 (3) , 321-330
- https://doi.org/10.1016/0304-3975(80)90019-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the additive complexity of polynomialsTheoretical Computer Science, 1980
- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomialsTheoretical Computer Science, 1978
- On the Number of Additions to Compute Specific PolynomialsSIAM Journal on Computing, 1976
- Polynomials with Rational Coefficients Which are Hard to ComputeSIAM Journal on Computing, 1974
- On the Number of Nonscalar Multiplications Necessary to Evaluate PolynomialsSIAM Journal on Computing, 1973