On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks (Q4596626)
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 6815161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks |
scientific article; zbMATH DE number 6815161 |
Statements
On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks (English)
0 references
4 December 2017
0 references
0.9770922660827636
0 references
0.7767768502235413
0 references
0.7701465487480164
0 references
0.7568514943122864
0 references
