2 citations · 2 across the 6 of their papers we have counts for
7 papers
Communication Complexity of Integer Matrix Singularity
Chengu Wang
Alice and Bob hold complementary halves of the columns of an matrix of -bit integers and decide whether it is singular over . Up to constant-factor dimens…
A Lower Bound of 21 for Matrix Multiplication over
Chengu Wang
We prove that matrix multiplication over has bilinear complexity at least , improving the previous lower bound of . Lower bounds for restrictions…
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 to . Our packings in dimensions to come from one chain of cross-sections of the extremal even u…
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…
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…
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…
The Garden Hose Complexity for the Equality Function
Well Y. Chiu, Mario Szegedy, Chengu Wang +1
The garden hose complexity is a new communication complexity introduced by H. Buhrman, S. Fehr, C. Schaffner and F. Speelman [BFSS13] to analyze position-based cryptography protoco…