Memory-restricted black-box complexity of OneMax

Authors:
Benjamin Doerr;Carola Winzen
Affiliations:
Max-Planck-Institut für Informatik, AG 1, Campus E 1 4, 66123 Saarbrücken, Germany;Max-Planck-Institut für Informatik, AG 1, Campus E 1 4, 66123 Saarbrücken, Germany
Venue:
Information Processing Letters
Year:
2012

Citing 6
Cited 0

On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

Theory of Computing Systems
Black-box search by unbiased variation

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Theory of Randomized Search Heuristics: Foundations and Recent Developments

Theory of Randomized Search Heuristics: Foundations and Recent Developments
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that the black-box complexity with memory restriction one of the n-dimensional OneMax function class is at most 2n. This disproves the @Q(nlogn) conjecture of Droste, Jansen, and Wegener (Theory Computing Systems 39 (2006) 525-544).