Chengu Wang

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2026

A Lower Bound of 21 for $3 \times 3$ Matrix Multiplication over $F_{2}$

Chengu Wang

We prove that $3 \times 3$ matrix multiplication over $F_{2}$ has bilinear complexity at least $21$ , improving the previous lower bound of $20$ . Lower bounds for restrictions…

cs.CC2026

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 $F_{q}$ . The frame…

A Lower Bound of 21 for 3×3 Matrix Multiplication over F2​

Automated Lower Bounds for Bilinear Complexity over Finite Fields

A Lower Bound of 21 for $3 \times 3$ Matrix Multiplication over $F_{2}$