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 cs.CCShow 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…

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…

cs.CC2014

On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model

Yi Li, Xiaoming Sun, Chengu Wang +1

We study the communication complexity of linear algebraic problems over finite fields in the multi-player message passing model, proving a number of tight lower bounds. Specificall…

Communication Complexity of Integer Matrix Singularity

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

Automated Lower Bounds for Bilinear Complexity over Finite Fields

On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model

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