Average complexity of divide-and-conquer algorithms (Q1114395): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average complexity of divide-and-conquer algorithms |
scientific article |
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
