Multiparty communication complexity and very hard functions
type: Item
instance of: scholarly article
title: Multiparty communication complexity and very hard functions
zbMATH Open document ID: 1087.68036
author: Pavol Ďuriš
published in: Information and Computation
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 2083156
MaRDI profile type: Publication
full work available at URL: j.ic.2004.03.002
OpenAlex ID: W2157201449
cites work: Lower bounds on communication complexity
cites work: Optimal lower bounds on the multiparty communication complexity
cites work: Communication Complexity
cites work: Construction of Very Hard Functions for Multiparty Communication Complexity
DOI: 10.1016/J.IC.2004.03.002
Recommended article: Q4941898
Recommended article: Construction of Very Hard Functions for Multiparty Communication Complexity
Recommended article: Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions
Recommended article: Q2762506
Recommended article: Q3002823
Recommended article: Lower bounds on the multiparty communication complexity
Recommended article: Advances in Cryptology - EUROCRYPT 2004
Recommended article: The NOF Multiparty Communication Complexity of Composed Functions
Recommended article: The NOF multiparty communication complexity of composed functions
description: scientific article; zbMATH DE number 2083156