On the complexity of min-max sorting networks (Q454886)
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: On the complexity of min-max sorting networks |
scientific article; zbMATH DE number 6092520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of min-max sorting networks |
scientific article; zbMATH DE number 6092520 |
Statements
On the complexity of min-max sorting networks (English)
0 references
10 October 2012
0 references
min-max circuits
0 references
sorting networks
0 references
merging networks
0 references
FPGA
0 references
0.7673726677894592
0 references
0.7660835981369019
0 references
0.7649834752082825
0 references
0.7643812894821167
0 references
0.7637670040130615
0 references
