ON THE AVERAGE-CASE COMPLEXITY OF SELECTING THE KTH BEST

被引：3
|
作者：
YAO, AC [1 ]
YAO, FF [1 ]
机构：
[1] XEROX CORP,PALO ALTO RES CTR,PALO ALTO,CA 94304
来源：
SIAM JOURNAL ON COMPUTING | 1982年 / 11卷 / 03期
关键词：
D O I：
10.1137/0211034
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：428 / 447
页数：20
相关论文
共 50 条
  • [41] Pseudorandomness and average-case complexity via uniform reductions
    Trevisan, L
    Vadhan, S
    17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, : 129 - 138
  • [42] Average-case analysis of algorithms using Kolmogorov complexity
    Jiang, T
    Li, M
    Vitányi, PMB
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2000, 15 (05) : 402 - 408
  • [43] Average-case analysis of algorithms using Kolmogorov complexity
    Tao Jiang
    Ming Li
    Paul M. B. Vitányi
    Journal of Computer Science and Technology, 2000, 15 : 402 - 408
  • [44] Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
    Hirahara, Shuichi
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 50 - 60
  • [45] The Average-Case Time Complexity of Certifying the Restricted Isometry Property
    Ding, Yunzi
    Kunisky, Dmitriy
    Wein, Alexander S.
    Bandeira, Afonso S.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (11) : 7355 - 7361
  • [46] The Program-Enumeration Bottleneck in Average-Case Complexity Theory
    Trevisan, Luca
    25TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - CCC 2010, 2010, : 88 - 95
  • [47] Robustness of Average-Case Meta-Complexity via Pseudorandomness
    Ilango, Rahul
    Ren, Hanlin
    Santhanam, Rahul
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 1575 - 1583
  • [48] Notions of average-case complexity for random 3-SAT
    Atserias, A
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 1 - 5
  • [49] Average-case complexity for the execution of recursive definitions on relational databases
    De la Vega W.F.
    Paschos V.T.
    Stafylopatis A.N.
    Acta Informatica, 1998, 35 (3) : 211 - 243
  • [50] Average-case complexity for the execution of recursive definitions on relational databases
    de la Vega, WF
    Paschos, VT
    Stafylopatis, AN
    ACTA INFORMATICA, 1998, 35 (03) : 211 - 243
12345