Lower Bounds for Quantum Communication Complexity (Q5454242): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58040226, #quickstatements; #temporary_batch_1710289860281 |
Created claim: DBLP publication ID (P1635): journals/siamcomp/Klauck07, #quickstatements; #temporary_batch_1731547958265 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0106160 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/Klauck07 / rank | |||
Normal rank | |||
Latest revision as of 03:20, 14 November 2024
scientific article; zbMATH DE number 5255541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds for Quantum Communication Complexity |
scientific article; zbMATH DE number 5255541 |
Statements
Lower Bounds for Quantum Communication Complexity (English)
0 references
28 March 2008
0 references
communication complexity
0 references
quantum computing
0 references
lower bounds
0 references
computational complexity
0 references
