✦ LIBER ✦

The Query Complexity of Finding Local Minima in the Lattice

✍ Scribed by Amos Beimel; Felix Geller; Eyal Kushilevitz

Book ID: 112252654
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 108 KB
Volume: 171
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3065

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.

The query complexity of order-finding

✍ Richard Cleve 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 212 KB

On the Quantum Query Complexity of Local

On the Quantum Query Complexity of Local Search in

✍ Xiaoming Sun; Andrew Chi-Chih Yao 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 539 KB

The lower bound for the number of local

The lower bound for the number of local minima of integral lattices

✍ M. O. Avdeeva 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 96 KB

The effect of local minima on the adjust

The effect of local minima on the adjustment of complex directional arrays

✍ Smith, J.L. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 872 KB

On the problem of local minima in backpr

On the problem of local minima in backpropagation

✍ Gori, M.; Tesi, A. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 926 KB