Bilinear mincing rank

AbstractWe define here the bilinear mincing rank of a bilinear form over a field of the characteristic zero, and we demonstrate that this invariant represents a new (in fact, the first known general and nontrivial) lower bound to the bilinear circuit-size complexity of a bilinear form