On the query complexity of finding a local maximum point. (Q1853165)
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: On the query complexity of finding a local maximum point. |
scientific article; zbMATH DE number 1856495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the query complexity of finding a local maximum point. |
scientific article; zbMATH DE number 1856495 |
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
0.9303199
0 references
0 references
0.8874215
0 references
0.8612399
0 references
0.85620666
0 references
0.8558227
0 references
