An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements (Q989536): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Michiel H. M. Smid / rank | |||
| Property / author | |||
| Property / author: Michiel H. M. Smid / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2184449363 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:19, 20 March 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
