On the Average-Case Complexity of Selecting the <i>k</i>th Best (Q3947142)
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: On the Average-Case Complexity of Selecting the kth Best |
scientific article; zbMATH DE number 3765169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Average-Case Complexity of Selecting the <i>k</i>th Best |
scientific article; zbMATH DE number 3765169 |
Statements
On the Average-Case Complexity of Selecting the <i>k</i>th Best (English)
0 references
1982
0 references
minimum average number of pairwise comparisons
0 references
binary tree
0 references
decision tree
0 references
selection
0 references
