Black-box complexity: advantages of memory usage

DOI10.1016/J.IPL.2016.01.009MaRDI QIDQ264203zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexityanalysis of algorithmsrandomized algorithmstheory of computation

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(2)

• Memory-restricted black-box complexity of OneMax
• From black-box complexity to designing new genetic algorithms

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)