Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > BILINEAR RANK:
Reports tagged with bilinear rank:
TR01-060 | 23rd August 2001
Amir Shpilka

#### Lower bounds for matrix product

We prove lower bounds on the number of product gates in bilinear
compute the product of two $n \times n$ matrices over finite fields.