Average-case Complexity

被引：0

作者：

Trevisan, Luca ^{[1
]}

机构：

[1] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA

来源：

PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE | 2008年

关键词：

D O I：

10.1109/FOCS.2008.90

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：11 / 11

页数：1

共 50 条

[21] Average-Case Analysis of Algorithms UsingKolmogorov Complexity
姜涛
李明
Journal of Computer Science & Technology, 2000, (05) : 402 - 408
[22] 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
[23] Average-case complexity of partial Boolean functions
Chashkin, A
STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, 2003, 2827 : 146 - 156
[24] Average-case complexity of elementary Boolean functions
Chashkin, A.V.
Discrete Mathematics and Applications, 2001, 11 (01): : 71 - 81
[25] On derandomization and average-case complexity of monotone functions
Karakostas, George
Kinne, Jeff
van Melkebeek, Dieter
THEORETICAL COMPUTER SCIENCE, 2012, 434 : 35 - 44
[26] ON THE AVERAGE-CASE COMPLEXITY OF SELECTING THE KTH BEST
YAO, AC
YAO, FF
SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 428 - 447
[27] Average-case complexity without the black swans
Amelunxen, Dennis
Lotz, Martin
JOURNAL OF COMPLEXITY, 2017, 41 : 82 - 101
[28] 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
[29] Relations between Average-Case and Worst-Case Complexity
A. Pavan
N. V. Vinodchandran
Theory of Computing Systems, 2008, 42 : 596 - 607
[30] Pseudorandomness and average-case complexity via uniform reductions
Trevisan, Luca
Vadhan, Salil
COMPUTATIONAL COMPLEXITY, 2007, 16 (04) : 331 - 364

← 1 2 3 4 5 →