An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements (Q989536): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q582044 |
Changed an Item |
||
| Property / author | |||
| Property / author: Michiel H. M. Smid / rank | |||
Normal rank | |||
Revision as of 05:41, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements |
scientific article |
Statements
An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements (English)
0 references
20 August 2010
0 references
lower bounds
0 references
order statistics
0 references
computational complexity
0 references
