Separating deterministic from randomized multiparty communication complexity (Q3002822)
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: Separating deterministic from randomized multiparty communication complexity |
scientific article; zbMATH DE number 5899295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating deterministic from randomized multiparty communication complexity |
scientific article; zbMATH DE number 5899295 |
Statements
24 May 2011
0 references
communication complexity
0 references
number on forehead
0 references
0.961036205291748
0 references
0.8802677392959595
0 references
0.8669323325157166
0 references
0.8558986783027649
0 references
0.8111433982849121
0 references
