Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Communication Complexity of Statistical Distance

From MaRDI portal
Publication:4973870
Jump to:navigation, search

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/



zbMATH Keywords

communication complexitystatistical distance


Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication complexity, information complexity (68Q11)



Related Items (1)

Interleaved Group Products






This page was built for publication: Communication Complexity of Statistical Distance

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4973870&oldid=19409664"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 10:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki