Black-box complexity: advantages of memory usage

DOI10.1016/J.IPL.2016.01.009zbMATH Open1356.68108OpenAlexW2250566958MaRDI QIDQ264203FDOQ264203

Authors: Tobias Storch 

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.01.009

Recommendations

• Memory-restricted black-box complexity of OneMax
• \textsc{OneMax} in black-box models with several restrictions
• From black-box complexity to designing new genetic algorithms
• Black-box complexity for bounding the performance of randomized search heuristics
• The \((1+1)\) elitist black-box complexity of LeadingOnes

zbMATH Keywords

computational complexityanalysis of algorithmsrandomized algorithmstheory of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• Complexity Theory
• Black-box search by unbiased variation
• Playing mastermind with constant-size memory
• Upper and lower bounds for randomized search heuristics in black-box optimization
• On the Black-Box Complexity of Example Functions
• Ranking-based black-box complexity
• Real royal road functions for constant population size

Cited In (1)

• Memory-restricted black-box complexity of OneMax

This page was built for publication: Black-box complexity: advantages of memory usage

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