A Class of Optimal Structures for Node Computations in Message Passing Algorithms (Q5030271)
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: A Class of Optimal Structures for Node Computations in Message Passing Algorithms |
scientific article; zbMATH DE number 7475619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Class of Optimal Structures for Node Computations in Message Passing Algorithms |
scientific article; zbMATH DE number 7475619 |
Statements
A Class of Optimal Structures for Node Computations in Message Passing Algorithms (English)
0 references
17 February 2022
0 references
message passing algorithms
0 references
minimum complexity
0 references
minimum latency
0 references
0.8697947
0 references
0.86518246
0 references
0.8642737
0 references
0.8630479
0 references
0.8609065
0 references
0.8597039
0 references
