Optimal algorithms and lower bounds for testing closeness of structured distributions

DOI10.1109/FOCS.2015.76MaRDI QIDQ6946833zbMATH OpenFDO

Authors Ilias Diakonikolas, Vladimir Nikishkin, Daniel M. Kane

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2015.76

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(2)

• Sample efficient identity testing and independence testing of quantum states
• Attainability of two-point testing rates for finite-sample location estimation

This page was built for publication: Optimal algorithms and lower bounds for testing closeness of structured distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946833)