• DocumentCode
    3174131
  • Title

    A lower bound for matrix multiplication

  • Author

    Bshouty, Nader H.

  • Author_Institution
    Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
  • fYear
    1988
  • fDate
    24-26 Oct 1988
  • Firstpage
    64
  • Lastpage
    67
  • Abstract
    It is proved that computing the product of two n× n matrices over the binary field requires at least 2.5n2-O(n2) multiplications
  • Keywords
    computational complexity; binary field; lower bound; matrix multiplication; Computer science; Galois fields; Linear code; Shape; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1988., 29th Annual Symposium on
  • Conference_Location
    White Plains, NY
  • Print_ISBN
    0-8186-0877-3
  • Type

    conf

  • DOI
    10.1109/SFCS.1988.21922
  • Filename
    21922
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3174131