On the query complexity of finding a local maximum point. (Q1853165): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5521146 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A proof-theoretic analysis of collection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the induction schema for decidable predicates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sperner's lemma and robust machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounded queries in recursion theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequential Minimax Search for a Maximum / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Revision as of 10:23, 5 June 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
