Simultaneous messages vs. communication

DOI10.1007/3-540-59042-0_88zbMath1379.68125OpenAlexW2146447528MaRDI QIDQ4596636

László Babai, Satyanarayana V. Lokam, Peter G. Kimmel

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_88

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (9)

Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Upper bound on the communication complexity of private information retrieval ⋮ Unnamed Item ⋮ Homomorphic secret sharing for low degree polynomials ⋮ The NOF multiparty communication complexity of composed functions ⋮ General constructions for information-theoretic private information retrieval ⋮ Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs ⋮ Some Open Problems in Information-Theoretic Cryptography

This page was built for publication: Simultaneous messages vs. communication