We improve some lower bounds which have been obtained by Strassen and Lipton. In particular there exist polynomials of degree n with 0–1 coefficients that cannot be evaluated with less than √n/(4 log n) nonscalar multiplications/divisions. The evaluation of (Formula Presented.) requires at least n/(12 log n) multiplications/divisions and at least √n/(8 log n) nonscalar multiplications/divisions. We specify polynomials with algebraic coefficients that require n/2 multiplications/divisions.
CITATION STYLE
Schnorr, C. P. (1977). Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 53 LNCS, pp. 135–147). Springer Verlag. https://doi.org/10.1007/3-540-08353-7_133
Mendeley helps you to discover research relevant for your work.