Average complexity of divide-and-conquer algorithms (Q1114395): 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.1016/0020-0190(88)90232-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068131793 / rank | |||
Normal rank | |||
Revision as of 00:40, 20 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
