The communication complexity of addition

From MaRDI portal

Revision as of 04:58, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5741754

Jump to:navigation, search

DOI10.1137/1.9781611973105.46zbMath1422.68076OpenAlexW2399968470MaRDI QIDQ5741754

Emanuele Viola

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.46

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (4)

Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ A discrepancy lower bound for information complexity ⋮ One-round multi-party communication complexity of distinguishing sums

This page was built for publication: The communication complexity of addition

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5741754&oldid=30500334"