On communication complexity of vector-valued functions

DOI10.1109/18.340481MaRDI QIDQ4850308zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Boolean functionsvector-valued functionsoptimal protocoltwo-way communication complexity

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(13)

• Communication complexity of convex optimization
• Ning Cai: a tribute to a pioneering scholar in information theory
• Ning Cai's work on communication complexity
• A characterization of average case communication complexity
• A general 4-words inequality with consequences for 2-way communication complexity
• scientific article; zbMATH DE number 88975 (Why is no real title available?)
• Communication complexity in lattices
• scientific article; zbMATH DE number 2170852 (Why is no real title available?)
• Functional inversion and communication complexity
• Multiparty communication complexity of vector-valued and sum-type functions
• Two-way communication complexity of sum-type functions for one processor to be informed
• Deterministic communication complexity of set intersection
• scientific article; zbMATH DE number 1512689 (Why is no real title available?)

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)