Publication:
Multiparty communication complexity of vector-valued and sum-type functions

Simple item page
dc.contributor.authorsTamm U.
dc.date.accessioned2022-03-15T02:10:04Z
dc.date.accessioned2026-01-11T14:38:48Z
dc.date.available2022-03-15T02:10:04Z
dc.date.issued2013
dc.description.abstractRudolf 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.
dc.identifier.doi10.1007/978-3-642-36899-8_21
dc.identifier.isbn9783642368981
dc.identifier.issn3029743
dc.identifier.urihttps://hdl.handle.net/11424/247400
dc.language.isoeng
dc.publisherSpringer Verlag
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectcommunication complexity
dc.subjectdirect sum functions
dc.subjecttensor product
dc.titleMultiparty communication complexity of vector-valued and sum-type functions
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage462
oaire.citation.startPage451
oaire.citation.titleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
oaire.citation.volume7777

Files

Collections

Araştırma Çıktıları