Abstract
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 \(\sqrt {n/}\)(4 log n) nonscalar multiplications/divisions. The evaluation of \(p(x) = \sum\limits_{\delta \doteq o}^n {e^{2\pi i/2^\delta } } x^\delta\)requires at least n/(12 log n) multiplications/divisions and at least \(\sqrt {n/ (8 log n)}\)nonscalar multiplications/divisions. We specify polynomials with algebraic coefficients that require n/2 multiplications/divisions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Belaga, E.G.: (1958) Some problems involved in the computation of polynomials. Dokl. Akad. Nauk 123, pp. 775–777
Lipton, R.: (1975) Polynomials with 0–1 coefficients that are hard to evaluate. Proceedings of 16th Annual Symp. on FCS, pp. 6–10
Lipton, R.J. and Stockmeyer, L.J.: (1976) Evaluation of polynomials with super-preconditioning. Proceedings of 8th Annual ACM Symp. on Theory of Computing, pp. 174–180
Motzkin, T.S.: (1955) Evaluation of polynomials and evaluation of rational functions. Bull. Amer. Math. Soc. 61, p. 163
Paterson, M.S. and Stockmeyer, L.J.: (1973) On the number of nonscalar multiplications necessary to evaluate polynomials. Siam J. Comp. 2, pp. 60–66
Sieveking, M.: (1976) On the number of multiplications necessary to compute rational functions. Preprint Universität Bielefeld
Strassen, V.: (1974) Polynomials with rational coefficients which are hard to compute. Siam J. Comp. 3, pp. 128–149
Winograd, S.: (1970) On the number of multiplications necessary to compute certain functions. Comm. Pure and Appl. Math. 23, pp. 165–179
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnorr, C.P. (1977). Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_133
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_133
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive