On rank vs. communication complexity
type: Item
instance of: scholarly article
title: On rank vs. communication complexity
zbMATH Open document ID: 0845.68038
DOI: 10.1007/BF01192527
author: Noam Nisan
author: A. Wigderson
published in: Combinatorica
publication date: 1996-09-15T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 837834
zbMATH Keywords: communication complexity
zbMATH Keywords: Boolean function
describes a project that uses: GRAFFITI
MaRDI profile type: Publication
cites work: A counterexample to the rank-coloring conjecture
cites work: Q3197865
cites work: A Bound for the Chromatic Number of a Graph
cites work: On the distributional complexity of disjointness
cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
full work available at URL: https://doi.org/10.1007/bf01192527
OpenAlex ID: W2175167577
description: scientific article; zbMATH DE number 837834