On interactive communication
From MaRDI portal
Publication:4336282
DOI10.1109/18.567643zbMath0869.94005MaRDI QIDQ4336282
Ning Cai, Zhen Zhang, Rudolf Ahlswede
Publication date: 26 August 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c6de19621309af8dfc6b2f7a0da33690dd46dabc
communication complexity; worst case complexity; abstract sources; average degree bound; hypergraph covering and coloring
Related Items