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 this page instead for the normal view: A simple proof of a time-space trade-off for sorting with linear comparisons |
scientific article; zbMATH DE number 3963208
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
