On the query complexity of finding a local maximum point. (Q1853165): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q636315 |
||
| Property / author | |||
| Property / author: Lev D. Beklemishev / rank | |||
Revision as of 03:39, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the query complexity of finding a local maximum point. |
scientific article |
Statements
On the query complexity of finding a local maximum point. (English)
0 references
21 January 2003
0 references
We calculate the minimal number of queries sufficient to find a local maximum point of a function on a discrete interval, for a model with \(M\) parallel queries, \(M\geqslant1\). Matching upper and lower bounds are obtained. The bounds are formulated in terms of certain Fibonacci type sequences of numbers.
0 references
Computational complexity
0 references
Decision trees
0 references
Local maximum search
0 references
Fibonacci numbers
0 references
