On the time-space tradeoff for sorting with linear queries (Q799115)
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 time-space tradeoff for sorting with linear queries |
scientific article; zbMATH DE number 3872697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the time-space tradeoff for sorting with linear queries |
scientific article; zbMATH DE number 3872697 |
Statements
On the time-space tradeoff for sorting with linear queries (English)
0 references
1982
0 references
sorting
0 references
linear queries
0 references
time-space tradeoff
0 references
branching programs
0 references
0.9095879793167114
0 references
0.8154960870742798
0 references
0.8036176562309265
0 references
0.7887016534805298
0 references
0.7809396386146545
0 references
