An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements (Q989536)
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: An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements |
scientific article; zbMATH DE number 5773832
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements |
scientific article; zbMATH DE number 5773832 |
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
0.6928036212921143
0 references
0.6871849298477173
0 references
0.6815170049667358
0 references
