Probabilistic communication complexity over the reals (Q2269005)
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: Probabilistic communication complexity over the reals |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic communication complexity over the reals |
scientific article |
Statements
Probabilistic communication complexity over the reals (English)
0 references
15 March 2010
0 references
probabilistic communication protocols
0 references
EMPTINESS
0 references
KNAPSACK problems
0 references
0.8313587307929993
0 references
0.797725260257721
0 references
0.7827502489089966
0 references
0.7818220257759094
0 references
0.7793827652931213
0 references
