Some improved bounds on communication complexity via new decomposition of cliques (Q2636816)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some improved bounds on communication complexity via new decomposition of cliques |
scientific article |
Statements
Some improved bounds on communication complexity via new decomposition of cliques (English)
0 references
18 February 2014
0 references
communication complexity
0 references
complete graphs
0 references
biclique partition
0 references
fooling set
0 references
rank
0 references
