Lower bounds in communication complexity based on factorization norms (Q5900542): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1250790.1250892 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982568420 / rank | |||
Normal rank | |||
Latest revision as of 19:47, 19 March 2024
scientific article; zbMATH DE number 5485507
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds in communication complexity based on factorization norms |
scientific article; zbMATH DE number 5485507 |
Statements
Lower bounds in communication complexity based on factorization norms (English)
0 references
5 January 2009
0 references
lower bounds
0 references
randomized communication complexity
0 references
quantum communication complexity
0 references
factorization norms
0 references
entanglement
0 references
