On the upper bound of the complexity of sorting (Q2662813): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0965542521020111 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3150971374 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the upper bound of the complexity of sorting |
scientific article |
Statements
On the upper bound of the complexity of sorting (English)
0 references
15 April 2021
0 references
sorting
0 references
complexity
0 references
decision tree
0 references
partial order
0 references
simplex
0 references
