By Topic

A 5/2n2-lower bound for the rank of n×n-matrix multiplication over arbitrary fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Blaser, M. ; Inst. fur Inf., Bonn Univ., Germany

We prove a lower bound of 5/2n2-3n for the rank of n×n-matrix multiplication over an arbitrary field. Similar bounds hold for the rank of the multiplication in noncommutative division algebras and for the multiplication of upper triangular matrices

Published in:

Foundations of Computer Science, 1999. 40th Annual Symposium on

Date of Conference: