A simple proof of a time-space trade-off for sorting with linear comparisons (Q1079376)
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 3963208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof of a time-space trade-off for sorting with linear comparisons |
scientific article; zbMATH DE number 3963208 |
Statements
A simple proof of a time-space trade-off for sorting with linear comparisons (English)
0 references
1986
0 references
linear branching programs
0 references
0.9095879793167114
0 references
0.8375892043113708
0 references
0.8257158398628235
0 references
0.818585216999054
0 references
