Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > INTERACTIVE PROOFS FOR DISTRIBUTIONS:
Reports tagged with interactive proofs for distributions:
TR25-200 | 4th December 2025
Oded Goldreich, Guy Rothblum

On doubly-sublinear interactive proofs for distributions

Revisions: 1

Interactive proofs of proximity for distributions, introduced by Chiesa and Gur (ITCS18) and extensively studied recently by Herman and Rothblum (STOC22, FOCS23, FOCS24}, offer a way of verifying properties of distributions using less samples than required to test these properties.

We say that such an interactive proof system is {\sf ... more >>>




ISSN 1433-8092 | Imprint