Still another rank determination of set intersection matrices with an application in communication complexity
type: Item
instance of: scholarly article
title: Still another rank determination of set intersection matrices with an application in communication complexity
zbMATH Open document ID: 0791.94002
DOI: 10.1016/0893-9659(94)90028-0
published in: Applied Mathematics Letters
publication date: 1994-05-24T00:00:00Z
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 15A03
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 571545
zbMATH Keywords: communication complexity
zbMATH Keywords: rank
zbMATH Keywords: characteristic function-value matrices
author: Ulrich Tamm
MaRDI profile type: Publication
full work available at URL: 0893-9659(94)90028-0
OpenAlex ID: W2021360967
cites work: Deterministic communication complexity of set intersection
cites work: Two-way communication complexity of sum-type functions for one processor to be informed
cites work: Communication complexity in lattices
cites work: Communication Complexity of Computing the Hamming Distance
Wikidata QID: Q128028658
Recommended article: Matrix rank and communication complexity
Recommended article: Beyond set disjointness
Recommended article: An Additive Combinatorics Approach Relating Rank to Communication Complexity
Recommended article: Deterministic communication complexity of set intersection
Recommended article: The Communication Complexity of Set Intersection and Multiple Equality Testing
Recommended article: The Probabilistic Communication Complexity of Set Intersection
Recommended article: The communication complexity of several problems in matrix computation
Recommended article: On rank vs. communication complexity
Recommended article: Q5111164
description: scientific article; zbMATH DE number 571545