scientific article; zbMATH DE number 1962814

zbMath1035.68517MaRDI QIDQ4418650

Anton Mityagin

Publication date: 11 August 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitydecision treeslocal maximum search

Mathematics Subject Classification ID

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

Related Items

Deterministic Algorithms for Unique Sink Orientations of Grids ⋮ Condition number based complexity estimate for computing local extrema ⋮ The complexity of optimization on grids