When can we sort in \(o(n\log n)\) time? (Q1356890): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcss.1997.1474 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964765091 / rank | |||
Normal rank | |||
Revision as of 21:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When can we sort in \(o(n\log n)\) time? |
scientific article |
Statements
When can we sort in \(o(n\log n)\) time? (English)
0 references
3 August 1997
0 references
random access machine
0 references
