Chengu Wang

activity

20132026

most citedThe Garden Hose Complexity for the Equality Function

2 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

cs.CC2026

Communication Complexity of Integer Matrix Singularity

Chengu Wang

Alice and Bob hold complementary halves of the columns of an $n \times n$ matrix of $k$ -bit integers and decide whether it is singular over $Q$ . Up to constant-factor dimens…

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…

math.MG2026

Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43

Ivan Dorofeev, Xiaoming Sun, Chengu Wang

We improve the best known sphere packings in every dimension from $38$ to $43$ . Our packings in dimensions $38$ to $42$ come from one chain of cross-sections of the extremal even u…

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…

Communication Complexity of Integer Matrix Singularity

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

Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43

Automated Lower Bounds for Bilinear Complexity over Finite Fields

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