On communication complexity of vector-valued functions

DOI10.1109/18.340481zbMath0833.68050OpenAlexW2119374264MaRDI QIDQ4850308

Ning Cai

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)

Related Items (4)

A characterization of average case communication complexity ⋮ Deterministic communication complexity of set intersection ⋮ Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Communication complexity in lattices

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