IEEE - Institute of Electrical and Electronics Engineers, Inc. - A 5/2n/sup 2/-lower bound for the rank of n/spl times/n-matrix multiplication over arbitrary fields

40th Annual Symposium on Foundations of Computer Science

Author(s): Blaser, M.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1999
Conference Location: New York City, NY, USA, USA
Conference Date: 17 October 1999
Page(s): 45 - 50
ISBN (Paper): 0-7695-0409-4
ISSN (Paper): 0272-5428
DOI: 10.1109/SFFCS.1999.814576
Regular:

We prove a lower bound of 5/2n/sup 2/-3n for the rank of n/spl times/n-matrix multiplication over an arbitrary field. Similar bounds hold for the rank of the multiplication in noncommutative... View More

Advertisement