Partition Arguments in Multiparty Communication Complexity

DOI10.1007/978-3-642-02927-1_33zbMath1248.68203arXiv0909.5684OpenAlexW2132328200MaRDI QIDQ3638050

Jan Draisma, Eyal Kushilevitz, Enav Weinreb

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.5684

Mathematics Subject Classification ID

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

This page was built for publication: Partition Arguments in Multiparty Communication Complexity