Tight bounds for blind search on the integers

DOI10.4230/LIPIcs.STACS.2008.1348zbMath1259.68151OpenAlexW1510611182MaRDI QIDQ4910723

Philipp Woelfel, Martin Dietzfelbinger, Ingo Wegener, Jonathan E. Rowe

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_d02a.html

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Precision, local search and unimodal functions ⋮ Oblivious Randomized Direct Search for Real-Parameter Optimization ⋮ Greedy routing in small-world networks with power-law degrees

This page was built for publication: Tight bounds for blind search on the integers