On the ``log rank''-conjecture in communication complexity
type: Item
instance of: scholarly article
title: On the ``log rank''-conjecture in communication complexity
zbMATH Open document ID: 0845.68050
DOI: 10.1007/BF01192528
author: Ran Raz
author: Boris Spieker
published in: Combinatorica
publication date: 1996-09-15T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 837835
zbMATH Keywords: communication complexity
Wikidata QID: Q122964261
MaRDI profile type: Publication
cites work: A counterexample to the rank-coloring conjecture
cites work: Whitney Number Inequalities for Geometric Lattices
cites work: Communication complexity and combinatorial lattice theory
cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
cites work: Q4001520
full work available at URL: https://doi.org/10.1007/bf01192528
OpenAlex ID: W2174446922
description: scientific article; zbMATH DE number 837835