Lower bounds in communication complexity based on factorization norms (Q5900542)
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: Lower bounds in communication complexity based on factorization norms |
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
