On communication complexity of vector-valued functions

DOI10.1109/18.340481zbMATH Open0833.68050OpenAlexW2119374264MaRDI QIDQ4850308FDOQ4850308

Authors: Ning Cai, Rudolf Ahlswede 

Publication date: 9 October 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1780497

Recommendations

• Communication complexity in lattices
• Deterministic communication complexity of set intersection
• Harmonic analysis, real approximation, and the communication complexity of Boolean functions

zbMATH Keywords

Boolean functionsvector-valued functionsoptimal protocoltwo-way communication complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (11)

• Communication complexity of convex optimization
• A characterization of average case communication complexity
• A general 4-words inequality with consequences for 2-way communication complexity
• Title not available (Why is that?)
• Communication complexity in lattices
• Title not available (Why is that?)
• Multiparty communication complexity of vector-valued and sum-type functions
• Functional inversion and communication complexity
• Two-way communication complexity of sum-type functions for one processor to be informed
• Title not available (Why is that?)
• Deterministic communication complexity of set intersection

This page was built for publication: On communication complexity of vector-valued functions

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