Communication Complexity and Lower Bounds on Multilective Computations (Q4265538): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:28, 6 February 2024
scientific article; zbMATH DE number 1339740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communication Complexity and Lower Bounds on Multilective Computations |
scientific article; zbMATH DE number 1339740 |
Statements
Communication Complexity and Lower Bounds on Multilective Computations (English)
0 references
17 October 2000
0 references
protocols
0 references
multilective computations
0 references
VLSI circuits
0 references
