Linear algebraic methods in communication complexity
type: Item
instance of: scholarly article
title: Linear algebraic methods in communication complexity
zbMATH Open document ID: 1278.68106
author: L. Deaett
author: Venkatesh Srinivasan
published in: Linear Algebra and its Applications
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 15A99
zbMATH DE Number: 6034506
zbMATH Keywords: communication complexity
zbMATH Keywords: matrix rank
zbMATH Keywords: minimum rank
zbMATH Keywords: sign rank
zbMATH Keywords: randomization
MaRDI profile type: Publication
full work available at URL: j.laa.2011.07.008
OpenAlex ID: W2000545126
cites work: Computational Complexity
cites work: Q4821526
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Matrix rank and communication complexity
cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
cites work: Q4065548
cites work: The minimum rank of symmetric matrices described by a graph: a survey
cites work: A linear lower bound on the unbounded error probabilistic communication complexity.
cites work: Quick approximation to matrices and applications
cites work: Q4320535
cites work: Q4217269
cites work: A note on minimum rank and maximum nullity of sign patterns
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: Communication Complexity
cites work: Complexity Lower Bounds using Linear Algebra
cites work: Communication complexity and combinatorial lattice theory
cites work: On rank vs. communication complexity
cites work: Probabilistic communication complexity
cites work: The Sign-Rank of AC$^0$
cites work: Lower bounds for predecessor searching in the cell probe model
cites work: Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
cites work: Expressing combinatorial optimization problems by linear programs
cites work: Q3735043
DOI: 10.1016/J.LAA.2011.07.008
description: scientific article; zbMATH DE number 6034506