Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials

  • C. P. Schnorr
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Belaga, E.G.: (1958) Some problems involved in the computation of polynomials. Dokl. Akad. Nauk 123, pp. 775–777Google Scholar
  2. 2.
    Lipton, R.: (1975) Polynomials with 0–1 coefficients that are hard to evaluate. Proceedings of 16th Annual Symp. on FCS, pp. 6–10Google Scholar
  3. 3.
    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–180Google Scholar
  4. 4.
    Motzkin, T.S.: (1955) Evaluation of polynomials and evaluation of rational functions. Bull. Amer. Math. Soc. 61, p. 163Google Scholar
  5. 5.
    Paterson, M.S. and Stockmeyer, L.J.: (1973) On the number of nonscalar multiplications necessary to evaluate polynomials. Siam J. Comp. 2, pp. 60–66CrossRefGoogle Scholar
  6. 6.
    Sieveking, M.: (1976) On the number of multiplications necessary to compute rational functions. Preprint Universität BielefeldGoogle Scholar
  7. 7.
    Strassen, V.: (1974) Polynomials with rational coefficients which are hard to compute. Siam J. Comp. 3, pp. 128–149CrossRefGoogle Scholar
  8. 8.
    Winograd, S.: (1970) On the number of multiplications necessary to compute certain functions. Comm. Pure and Appl. Math. 23, pp. 165–179Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • C. P. Schnorr
    • 1
  1. 1.Fachbereich Mathematik der Universität FrankfurtFrankfurt am Main

Personalised recommendations