Quantum versus randomized communication complexity, with efficient players (Q2099674)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7622849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum versus randomized communication complexity, with efficient players |
scientific article; zbMATH DE number 7622849 |
Statements
Quantum versus randomized communication complexity, with efficient players (English)
0 references
24 November 2022
0 references
quantum
0 references
randomized
0 references
communication complexity
0 references
exponential separation
0 references
0 references
0 references
0.8258283138275146
0 references
0.8232679963111877
0 references
0.7977715134620667
0 references
0.7964578866958618
0 references
0.7958143949508667
0 references
