On the query complexity of finding a local maximum point.

DOI10.1016/S0020-0190(02)00313-7zbMath1042.68054OpenAlexW2029791193MaRDI QIDQ1853165

A. L. Rastsvetaev, Lev D. Beklemishev

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00313-7

zbMATH Keywords

Fibonacci numbersComputational complexityDecision treesLocal maximum search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

On the complexity of finding a local maximum of functions on discrete planar subsets ⋮ Operations research applications of dichotomous search

Cites Work

• Unnamed Item
• Unnamed Item
• A proof-theoretic analysis of collection
• Sperner's lemma and robust machines
• Bounded queries in recursion theory
• On the induction schema for decidable predicates
• Sequential Minimax Search for a Maximum

This page was built for publication: On the query complexity of finding a local maximum point.