𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The query complexity of order-finding

✍ Scribed by Richard Cleve

Book ID
113641521
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
212 KB
Volume
192
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the query complexity of finding a loc
On the query complexity of finding a local maximum point
✍ A.L. Rastsvetaev; L.D. Beklemishev πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 94 KB

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.