• DocumentCode
    1142047
  • Title

    An Improved Lower Bound on Polynomial Multiplication

  • Author

    Brown, Mark R. ; Dobkin, David P.

  • Author_Institution
    Department of Computer Science, Yale University
  • Issue
    5
  • fYear
    1980
  • fDate
    5/1/1980 12:00:00 AM
  • Firstpage
    337
  • Lastpage
    340
  • Abstract
    We prove an asymptotic lower bound of 3.52n nonscalar multiplications for (degree n – 1 by degree n – 1) polynomial multiplication in a model which allows only integers as scalars. Index Terms-Algebraic complexity, lower bound, polynomial multiplication.
  • Keywords
    Binary codes; Computational modeling; Costs; Information rates; Matrix decomposition; Performance evaluation; Polynomials; Tensile stress; Vectors;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1980.1675583
  • Filename
    1675583
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1142047