On rank vs. communication complexity
- 1 December 1995
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 15 (4) , 557-565
- https://doi.org/10.1007/bf01192527
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On rank vs. communication complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the ?log rank?-conjecture in communication complexityCombinatorica, 1995
- On the distributional complexity of disjointnessTheoretical Computer Science, 1992
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinearDiscrete Mathematics, 1992
- On the degree of Boolean functions as real polynomialsPublished by Association for Computing Machinery (ACM) ,1992
- A counterexample to the rank‐coloring conjectureJournal of Graph Theory, 1989
- Tite Probabilistic Communication Complexity of Set Intersection (Preliminary Version)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Lower bounds by probabilistic argumentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- A Bound for the Chromatic Number of a GraphThe American Mathematical Monthly, 1976