On rank vs. communication complexity (Q1906852): 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: Q3197865 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Bound for the Chromatic Number of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the distributional complexity of disjointness / 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01192527 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2175167577 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On rank vs. communication complexity |
scientific article |
Statements
On rank vs. communication complexity (English)
0 references
15 September 1996
0 references
communication complexity
0 references
Boolean function
0 references
