Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > MOMENT MATCHING:
Reports tagged with moment matching:
TR26-009 | 27th January 2026
Clement Canonne

A short note on (distribution) testing lower bounds via polynomials

In this short expository note, we provide an introduction to a distribution testing (and, more generally, indistinguishability) lower bound method based on moment-matching via polynomials. This method, which underlies several of the tight lower bounds on estimating symmetric properties, had for many years appeared mysterious and near-magical to the ... more >>>




ISSN 1433-8092 | Imprint