Memory-restricted black-box complexity of OneMax

Information Processing Letters（2012）

引用 14|浏览0

暂无评分

摘要

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).

查看译文

关键词

theory computing systems,black-box complexity,memory-restricted black-box complexity,memory restriction,n-dimensional onemax function class,algorithms

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要