Skip to main content
SpringerLink
Log in

Lower bounds for the multiplicative complexity of matrix multiplication

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

We prove a lower bound of km + mn + k—m + n— 3 for the multiplicative complexity of the multiplication of \( k \times m \)-matrices with \( m \times n \)-matrices using the substitution method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut für Informatik II, Universität Bonn, Römerstr. 164, 53117 Bonn, Germany, , , , , , DE

    M. Bläser

Authors
  1. M. Bläser
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: July 8, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bläser, M. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. complex. 8, 203–226 (1999). https://doi.org/10.1007/s000370050028

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000370050028

Search

Navigation