One-round multi-party communication complexity of distinguishing sums

DOI10.1016/j.tcs.2013.07.026zbMath1296.68072arXiv1301.4269OpenAlexW2009939074MaRDI QIDQ391326

Alex J. Malozemoff, Daniel Apon, Jonathan N. Katz

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.4269

zbMATH Keywords

communication complexityadditive combinatoricsintrusion detectiondistinguishing sumsone-round protocols

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• On data structures and asymmetric communication complexity
• Communication Complexity
• The communication complexity of addition

This page was built for publication: One-round multi-party communication complexity of distinguishing sums