Abstract
Rudolf Ahlswede's work on communication complexity dealt with functions defined on direct sums: vector-valued functions and sum-type functions. He was interested in single-letter characterizations and provided several lower bound techniques to this aim. In this paper we shall review these lower bounds and extend them to the "number in hand" multiparty model of communication complexity. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Tamm, U. (2013). Multiparty communication complexity of vector-valued and sum-type functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 451–462). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
