A lower bound for sorting networks based on the shuffle permutation (Q4311642)
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 lower bound for sorting networks based on the shuffle permutation |
scientific article; zbMATH DE number 679590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for sorting networks based on the shuffle permutation |
scientific article; zbMATH DE number 679590 |
Statements
A lower bound for sorting networks based on the shuffle permutation (English)
0 references
30 October 1994
0 references
sorting network
0 references
0.8873301148414612
0 references
0.8829917907714844
0 references
0.8159957528114319
0 references
0.795674741268158
0 references
