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 条
  • [1] Black-box complexity: Advantages of memory usage
    Storch, Tobias
    INFORMATION PROCESSING LETTERS, 2016, 116 (06) : 428 - 432
  • [2] One Max in Black-Box Models with Several Restrictions
    Doerr, Carola
    Lengler, Johannes
    GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 1431 - 1438
  • [3] On the Black-Box Complexity of Correlation Intractability
    Doettling, Nico
    Mour, Tamer
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [4] The quantum black-box complexity of majority
    Hayes, TP
    Kutin, S
    van Melkebeek, D
    ALGORITHMICA, 2002, 34 (04) : 480 - 501
  • [5] The complexity of black-box ring problems
    Arvind, V.
    Das, Bireswar
    Mukhopadhyay, Partha
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 126 - 135
  • [6] BLACK-BOX COMPLEXITY OF LOCAL MINIMIZATION
    Vavasis, Stephen A.
    SIAM JOURNAL ON OPTIMIZATION, 1993, 3 (01) : 60 - 80
  • [7] The Quantum Black-Box Complexity of Majority
    Algorithmica, 2002, 34 : 480 - 501
  • [8] Limited Memory, Limited Arity Unbiased Black-Box Complexity: First Insights
    Bulanova, Nina
    Buzdalov, Maxim
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 2020 - 2023
  • [9] On the Round Complexity of Black-Box Secure MPC
    Ishai, Yuval
    Khurana, Dakshita
    Sahai, Amit
    Srinivasan, Akshayaram
    ADVANCES IN CRYPTOLOGY - CRYPTO 2021, PT II, 2021, 12826 : 214 - 243
  • [10] THE BLACK-BOX QUERY COMPLEXITY OF POLYNOMIAL SUMMATION
    Juma, Ali
    Kabanets, Valentine
    Rackoff, Charles
    Shpilka, Amir
    COMPUTATIONAL COMPLEXITY, 2009, 18 (01) : 59 - 79
12345