On rank vs. communication complexity

This publication has 9 references indexed in Scilit:

• On the distributional complexity of disjointness
  Published by Springer Nature ,2005
• On the "log rank"-conjecture in communication complexity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The Probabilistic Communication Complexity of Set Intersection
  SIAM Journal on Discrete Mathematics, 1992
• The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
  Discrete Mathematics, 1992
• On the degree of Boolean functions as real polynomials
  Published by Association for Computing Machinery (ACM) ,1992
• A counterexample to the rank‐coloring conjecture
  Journal of Graph Theory, 1989
• Lower bounds by probabilistic arguments
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Some complexity questions related to distributive computing(Preliminary Report)
  Published by Association for Computing Machinery (ACM) ,1979
• A Bound for the Chromatic Number of a Graph
  The American Mathematical Monthly, 1976