On the query complexity of finding a local maximum point

Authors:
A. L. Rastsvetaev;L. D. Beklemishev
Affiliations:
Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS Utrecht, The Netherlands;Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS Utrecht, The Netherlands
Venue:
Information Processing Letters
Year:
2002

Citing 2
Cited 2

Search problems in the decision tree model (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set

On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the complexity of finding a local maximum of functions on discrete planar subsets

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 ≥ 1. Matching upper and lower bounds are obtained. The bounds are formulated in terms of certain Fibonacci type sequences of numbers.