Communication complexity of set-disjointness for all probabilities
type: Item
instance of: scholarly article
zbMATH Open document ID: 1365.68259
published in: Theory of Computing
publication date: 2016-08-22T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6618606
zbMATH Keywords: communication complexity
zbMATH Keywords: set-disjointness
zbMATH Keywords: complexity classes
MaRDI profile type: MaRDI publication profile
full work available at URL: toc.2016.v012a009
OpenAlex ID: W3037028364
cites work: An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
cites work: Lower Bounds for Swapping Arthur and Merlin
cites work: The Pattern Matrix Method
cites work: Q5414596
DOI: 10.4086/TOC.2016.V012A009
Recommended article: Q2969658
Recommended article: Q3002788
Recommended article: The Probabilistic Communication Complexity of Set Intersection
Recommended article: The multiparty communication complexity of set disjointness
Recommended article: The communication complexity of multiparty set disjointness under product distributions
Recommended article: Deterministic communication complexity of set intersection
Recommended article: Communication Complexity Theory: Thirty-Five Years of Set Disjointness
Recommended article: Beyond set disjointness
Recommended article: Probabilistic communication complexity
author: Mika Göös
author: Thomas Watson
title: Communication complexity of set-disjointness for all probabilities
description: scientific article; zbMATH DE number 6618606