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 条
  • [31] Average-case bounds for the complexity of path-search
    Pippenger, N
    ADVANCES IN SWITCHING NETWORKS, 1998, 42 : 1 - 13
  • [32] Average-case complexity and decision problems in group theory
    Kapovich, I
    Myasnikov, A
    Schupp, P
    Shpilrain, V
    ADVANCES IN MATHEMATICS, 2005, 190 (02) : 343 - 359
  • [33] Relations between average-case and worst-case complexity
    Pavan, A.
    Vinodchandran, N. V.
    THEORY OF COMPUTING SYSTEMS, 2008, 42 (04) : 596 - 607
  • [34] Relations between average-case and worst-case complexity
    Pavan, A
    Vinodchandran, NV
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 422 - 432
  • [35] The Value of Help Bits in Randomized and Average-Case Complexity
    Salman Beigi
    Omid Etesami
    Amin Gohari
    computational complexity, 2017, 26 : 119 - 145
  • [36] Average-case complexity of the Whitehead problem for free groups
    Shpilrain, Vladimir
    COMMUNICATIONS IN ALGEBRA, 2023, 51 (02) : 799 - 806
  • [37] THE VALUE OF HELP BITS IN RANDOMIZED AND AVERAGE-CASE COMPLEXITY
    Beigi, Salman
    Etesami, Omid
    Gohari, Amin
    COMPUTATIONAL COMPLEXITY, 2017, 26 (01) : 119 - 145
  • [38] Junta distributions and the average-case complexity of manipulating elections
    Procaccia, Ariel D.
    Rosenschein, Jeffrey S.
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2007, 28 (157-181): : 157 - 181
  • [39] Bounds for the average-case complexity of monotone Boolean functions
    Chashkin A.V.
    Discrete Mathematics and Applications, 2017, 27 (03): : 137 - 142
  • [40] Pseudorandomness and Average-Case Complexity Via Uniform Reductions
    Luca Trevisan
    Salil Vadhan
    computational complexity, 2007, 16 : 331 - 364
12345