A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0022-0000(02)00019-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143355494 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear lower bound on the unbounded error probabilistic communication complexity. |
scientific article |
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
