Rearrangeability of \((2\log_n N-1)\)-stage networks employing a uniform connection pattern (Q2368634)
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: Rearrangeability of (2_n N-1)-stage networks employing a uniform connection pattern |
scientific article; zbMATH DE number 5019649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rearrangeability of \((2\log_n N-1)\)-stage networks employing a uniform connection pattern |
scientific article; zbMATH DE number 5019649 |
Statements
Rearrangeability of \((2\log_n N-1)\)-stage networks employing a uniform connection pattern (English)
0 references
26 April 2006
0 references
0.9138298630714417
0 references
0.8616147637367249
0 references
0.824714183807373
0 references
