Deterministic communication complexity of set intersection
type: Item
instance of: scholarly article
title: Deterministic communication complexity of set intersection
zbMATH Open document ID: 0831.68053
DOI: 10.1016/0166-218X(94)00021-5
author: Ulrich Tamm
published in: Discrete Applied Mathematics
publication date: 1996-02-13T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 94A99
zbMATH DE Number: 790492
zbMATH Keywords: communication complexity
zbMATH Keywords: communication protocol
MaRDI profile type: Publication
cites work: On communication complexity of vector-valued functions
cites work: A general 4-words inequality with consequences for 2-way communication complexity
cites work: Communication Complexity of Computing the Hamming Distance
cites work: Lower bounds on communication complexity in distributed computer networks
cites work: Q3705356
description: scientific article; zbMATH DE number 790492