On the ?log rank?-conjecture in communication complexity
- 1 December 1995
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 15 (4) , 567-588
- https://doi.org/10.1007/bf01192528
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On rank vs. communication complexityCombinatorica, 1995
- Communication complexity and combinatorial lattice theoryJournal of Computer and System Sciences, 1993
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinearDiscrete Mathematics, 1992
- A counterexample to the rank‐coloring conjectureJournal of Graph Theory, 1989
- On the communication complexity of graph propertiesPublished by Association for Computing Machinery (ACM) ,1988
- Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979
- Whitney number inequalities for geometric latticesProceedings of the American Mathematical Society, 1975