On multi-partition communication complexity (Q1886038)
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: On multi-partition communication complexity |
scientific article; zbMATH DE number 2115409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On multi-partition communication complexity |
scientific article; zbMATH DE number 2115409 |
Statements
On multi-partition communication complexity (English)
0 references
12 November 2004
0 references
Computational complexity
0 references
Multi-partition communication complexity
0 references
Non-obliviousness
0 references
Lower bounds
0 references
Complexity hierarchy
0 references
Read-once branching programs
0 references
\(k\)-partition protocols
0 references
0 references
0.9340254
0 references
0.9340254
0 references
0.89041936
0 references
0.88985664
0 references
0.88985664
0 references
