2 papers
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 . The frame…
cs.DS2025
Depth-13 Sorting Networks for 28 Channels
Chengu Wang
We establish new depth upper bounds for sorting networks on 27 and 28 channels, improving the previous best bound of 14 to 13. Our 28-channel network is constructed with reflection…