On the ``log rank''-conjecture in communication complexity (Q1906853): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A counterexample to the rank-coloring conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Whitney Number Inequalities for Geometric Lattices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Communication complexity and combinatorial lattice theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4001520 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01192528 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2174446922 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the ``log rank''-conjecture in communication complexity |
scientific article |
Statements
On the ``log rank''-conjecture in communication complexity (English)
0 references
15 September 1996
0 references
communication complexity
0 references
0 references
