Improved upper bounds on the simultaneous messages complexity of the generalized addressing function

DOI10.1007/10719839_21MaRDI QIDQ4508377zbMATH OpenFDO

Authors Satyanarayana V. Lokam, Andris Ambainis

Publication date 29 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10719839_21

zbMATH Keywords

generalized addressing functions

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)

Recommendations

• Communication Complexity of Simultaneous Messages
• Simultaneous messages vs. communication
• scientific article; zbMATH DE number 1769898
• On communication complexity of vector-valued functions
• The NOF multiparty communication complexity of composed functions

Cited in

(6)

• General constructions for information-theoretic private information retrieval
• Communication Complexity of Simultaneous Messages
• scientific article; zbMATH DE number 1769898 (Why is no real title available?)
• Simultaneous messages vs. communication
• Interleaved Group Products
• Bounded simultaneous messages

This page was built for publication: Improved upper bounds on the simultaneous messages complexity of the generalized addressing function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508377)