On multiparty communication with large versus unbounded error (Q4612487)
From MaRDI portal
!
WARNING
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 7009621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On multiparty communication with large versus unbounded error |
scientific article; zbMATH DE number 7009621 |
Statements
31 January 2019
0 references
lower bounds
0 references
separation of complexity classes
0 references
multiparty communication complexity
0 references
unbounded-error communication complexity
0 references
PP
0 references
UPP
0 references
0 references
0 references
0 references
0.8501231670379639
0 references
0.80213862657547
0 references
0.7942185997962952
0 references
0.7803433537483215
0 references
0.7766517996788025
0 references
