Average complexity of divide-and-conquer algorithms (Q1114395)
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: Average complexity of divide-and-conquer algorithms |
scientific article; zbMATH DE number 4082969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average complexity of divide-and-conquer algorithms |
scientific article; zbMATH DE number 4082969 |
Statements
Average complexity of divide-and-conquer algorithms (English)
0 references
1988
0 references
The goal of this paper is to describe a rather general approach for constructing upper and lower bounds for the average computational complexity of divide-and-conquer algorithms.
0 references
unicrossing pair of functions
0 references
upper and lower bounds
0 references
average computational complexity
0 references
divide-and-conquer algorithms
0 references
0 references
