Distribution Testing Lower Bounds via Reductions from Communication Complexity
ACM TRANSACTIONS ON COMPUTATION THEORY, 2019.
Communication complexitydistribution testinglower boundsproperty testingK-functional
We present a new methodology for proving distribution testing lower bounds, establishing a connection between distribution testing and the simultaneous message passing (SMP) communication model. Extending the framework of Blais, Brody, and Matulef , we showa simpleway to reduce (private- coin) SMP problems to distribution testing prob...More
Full Text (Upload PDF)
PPT (Upload PPT)