A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear lower bound on the unbounded error probabilistic communication complexity. |
scientific article; zbMATH DE number 1910852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear lower bound on the unbounded error probabilistic communication complexity. |
scientific article; zbMATH DE number 1910852 |
Statements
A linear lower bound on the unbounded error probabilistic communication complexity. (English)
0 references
14 May 2003
0 references
probabilistic communication complexity
0 references
Hadamard matrix
0 references
spectral norm
0 references
lower bounds
0 references
0 references
