Memory-restricted black-box complexity of OneMax
type: Item
instance of: scholarly article
title: Memory-restricted black-box complexity of OneMax
zbMATH Open document ID: 1233.68235
author: Benjamin Doerr
author: Carola Winzen
published in: Information Processing Letters
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6013681
zbMATH Keywords: black-box algorithms
zbMATH Keywords: black-box complexity
zbMATH Keywords: query complexity
zbMATH Keywords: bounded memory
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.10.004
OpenAlex ID: W1991060790
cites work: Upper and lower bounds for randomized search heuristics in black-box optimization
cites work: Complexity measures and decision tree complexity: a survey.
cites work: Q5731202
cites work: Q5306039
cites work: Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
DOI: 10.1016/J.IPL.2011.10.004
description: scientific article; zbMATH DE number 6013681