Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions

DOI10.1007/978-3-642-36899-8_21zbMath1377.68089OpenAlexW102354387MaRDI QIDQ4915250

Ulrich Tamm

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_21

zbMATH Keywords

tensor productcommunication complexitydirect sum functions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Partition arguments in multiparty communication complexity
• A two-family extremal problem in Hamming space
• Inequalities for code pairs
• A general 4-words inequality with consequences for 2-way communication complexity
• The space complexity of approximating the frequency moments
• Still another rank determination of set intersection matrices with an application in communication complexity
• Communication complexity in lattices
• Code pairs with specified parity of the Hamming distances
• Communication complexity of sum-type functions invariant under translation
• Deterministic communication complexity of set intersection
• Two-way communication complexity of sum-type functions for one processor to be informed
• On rank vs. communication complexity
• On communication complexity of vector-valued functions
• Amortized Communication Complexity
• Communication Complexity

This page was built for publication: Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions