Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence (Q4339007)
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: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence |
scientific article; zbMATH DE number 1016834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence |
scientific article; zbMATH DE number 1016834 |
Statements
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence (English)
0 references
4 June 1997
0 references
divide-and-conquer algorithm
0 references
time complexity
0 references
0.9040289521217346
0 references
0.8805469274520874
0 references
0.8787409067153931
0 references
