2 papers
cs.CC2025
The communication complexity of distributed estimation
Parikshit Gopalan, Raghu Meka, Prasad Raghavendra +2
We study an extension of the standard two-party communication model in which Alice and Bob hold probability distributions and over domains and , respectively. Their…
cs.CC2025
Constant-Depth Arithmetic Circuits for Linear Algebra Problems
Robert Andrews, Avi Wigderson
We design polynomial size, constant depth (namely, ) arithmetic formulae for the greatest common divisor (GCD) of two polynomials, as well as the related problems of…