Average-case complexity of elementary Boolean functions

被引：0
|
作者：
Chashkin, A.V.
机构：
来源：
Discrete Mathematics and Applications | 2001年 / 11卷 / 01期
关键词：
D O I：
10.1515/dma.2001.11.1.71
中图分类号：
学科分类号：
摘要：
6
引用
收藏
页码：71 / 81
相关论文
共 50 条
  • [31] A lower bound on the average-case complexity of shellsort
    Jiang, T
    Li, M
    Vitányi, P
    JOURNAL OF THE ACM, 2000, 47 (05) : 905 - 911
  • [32] Using depth to capture average-case complexity
    Antunes, L
    Fortnow, L
    Vinodchandran, NV
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 303 - 310
  • [33] Parameterized Average-Case Complexity of the Hypervolume Indicator
    Bringmann, Karl
    Friedrich, Tobias
    GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 575 - 582
  • [34] AVERAGE-CASE COMPLEXITY OF LINEAR MULTIVARIATE PROBLEMS
    WOZNIAKOWSKI, H
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1993, 29 (01) : 70 - 76
  • [35] Average-Case Analysis of Algorithms UsingKolmogorov Complexity
    姜涛
    李明
    JournalofComputerScienceandTechnology, 2000, (05) : 402 - 408
  • [36] Subsampling Mathematical Relaxations and Average-case Complexity
    Barak, Boaz
    Hardt, Moritz
    Holenstein, Thomas
    Steurer, David
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 512 - 531
  • [37] ON THE AVERAGE-CASE COMPLEXITY OF SELECTING THE KTH BEST
    YAO, AC
    YAO, FF
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 428 - 447
  • [38] Average-case complexity without the black swans
    Amelunxen, Dennis
    Lotz, Martin
    JOURNAL OF COMPLEXITY, 2017, 41 : 82 - 101
  • [39] On the Complexity of Searching in Trees: Average-Case Minimization
    Jacobs, Tobias
    Cicalese, Ferdinando
    Laber, Eduardo
    Molinaro, Marco
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2010, 6198 : 527 - 539
  • [40] Certificate complexity of elementary symmetric Boolean functions
    Zhang, Jing
    Li, Yuan
    THEORETICAL COMPUTER SCIENCE, 2022, 938 : 16 - 23
12345