Memory-restricted black-box complexity of One Max

被引：6
|
作者：
Doerr, Benjamin [1 ]
Winzen, Carola [1 ]
机构：
[1] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
来源：
INFORMATION PROCESSING LETTERS | 2012年 / 112卷 / 1-2期
关键词：
Algorithms; Black-box complexity; Query complexity; Bounded memory;
D O I：
10.1016/j.ipl.2011.10.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 Theta(n logn) conjecture of Droste, Jansen, and Wegener (Theory Computing Systems 39 (2006) 525-544). (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：32 / 34
页数：3
相关论文
共 50 条
  • [21] On the Black-Box Complexity of Sperner’s Lemma
    Katalin Friedl
    Gábor Ivanyos
    Miklos Santha
    Yves F. Verhoeven
    Theory of Computing Systems, 2009, 45
  • [22] The unbiased black-box complexity of partition is polynomial
    Doerr, Benjamin
    Doerr, Carola
    Koetzing, Limo
    ARTIFICIAL INTELLIGENCE, 2014, 216 : 275 - 286
  • [23] The Complexity of Black-Box Mechanism Design with Priors
    Gergatsouli, Evangelia
    Lucier, Brendan
    Tzamos, Christos
    ACM EC '19: PROCEEDINGS OF THE 2019 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2019, : 869 - 883
  • [24] The Unrestricted Black-Box Complexity of Jump Functions
    Buzdalov, Maxim
    Doerr, Benjamin
    Kever, Mikhail
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION), 2017, : 1 - 2
  • [25] Unbiased Black-Box Complexity of Parallel Search
    Badkobeh, Golnaz
    Lehre, Per Kristian
    Sudholt, Dirk
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIII, 2014, 8672 : 892 - 901
  • [26] Parallel Black-Box Complexity With Tail Bounds
    Lehre, Per Kristian
    Sudholt, Dirk
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (06) : 1010 - 1024
  • [27] Unbiased black-box complexity of parallel search
    Badkobeh, Golnaz
    Lehre, Per Kristian
    Sudholt, Dirk
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8672 : 892 - 901
  • [28] Black-Box Complexity of the Binary Value Function
    Bulanova, Nina
    Buzdalov, Maxim
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 423 - 424
  • [29] Counting complexity of solvable black-box group problems
    Vinodchandran, NV
    SIAM JOURNAL ON COMPUTING, 2004, 33 (04) : 852 - 869
  • [30] The black-box complexity of nearest-neighbor search
    Krauthgamer, R
    Lee, JR
    THEORETICAL COMPUTER SCIENCE, 2005, 348 (2-3) : 262 - 276
12345