Communication Complexity of Statistical Distance
From MaRDI portal
Publication:4973870
DOI10.1145/3170708zbMATH Open1427.68084OpenAlexW2784688133MaRDI QIDQ4973870
No author found.
Publication date: 6 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7598/
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication complexity, information complexity (68Q11)
Related Items (1)
This page was built for publication: Communication Complexity of Statistical Distance