scientific article; zbMATH DE number 1962814

MaRDI QIDQ4418650zbMATH OpenFDO

Authors Anton Mityagin

Publication date 11 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070203.htm

zbMATH Keywords

computational complexitydecision treeslocal maximum search

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the complexity of finding a local maximum of functions on discrete planar subsets
• On the query complexity of finding a local maximum point.
• On the deterministic complexity of searching local maxima
• scientific article; zbMATH DE number 3958602
• Local optimization on graphs

Cited in

(9)

• Condition number based complexity estimate for computing local extrema
• Local optimization on graphs
• On the deterministic complexity of searching local maxima
• On the query complexity of finding a local maximum point.
• On the complexity of finding a local maximum of functions on discrete planar subsets
• The complexity of optimization on grids
• Deterministic algorithms for unique sink orientations of grids
• Inapproximability of finding maximum hidden sets on polygons and terrains
• Approximate maxima finding of continuous functions under restricted budget (extended abstract)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418650)