The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems (Q5756728)
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 5187386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems |
scientific article; zbMATH DE number 5187386 |
Statements
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems (English)
0 references
5 September 2007
0 references
0.92936313
0 references
0.9250165
0 references
0.9140791
0 references
0 references
0.9091594
0 references
0.9066978
0 references
0 references
