Automated Lower Bounds for Bilinear Complexity over Finite Fields

Chengu Wang

We present a general, automated framework for proving lower bounds on the bilinear complexity (tensor rank) of multiplication problems over a finite field ${\mathbb{F}}_q$. The frame…