Sampling lower bounds: Boolean average-case and permutations

被引：0
|
作者：
Viola, Emanuele [1 ]
机构：
[1] dagger Khoury College of Computer Sciences, Northeastern University, Boston,MA,02115, United States
来源：
SIAM Journal on Computing | 2020年 / 49卷 / 01期
关键词：
Average case - Cell probes - Local map - Local mean - Lower bounds - Min-entropy - Output distribution - Statistical distance;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
60
引用
收藏
页码：119 / 137
相关论文
共 50 条
  • [21] 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
  • [22] LOWER BOUNDS FOR SAMPLING ALGORITHMS FOR ESTIMATING THE AVERAGE
    CANETTI, R
    EVEN, G
    GOLDREICH, O
    INFORMATION PROCESSING LETTERS, 1995, 53 (01) : 17 - 25
  • [23] Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
    Meyer, U
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 48 (01): : 91 - 134
  • [24] Average-case analysis of classification algorithms for Boolean functions and decision trees
    Scheffer, T
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2000, 1968 : 194 - 208
  • [25] On the average-case complexity of Boolean functions under binomial distribution on their domains
    Chashkin, Aleksandr, V
    DISCRETE MATHEMATICS AND APPLICATIONS, 2021, 31 (05): : 315 - 318
  • [26] An Average-Case Efficient Algorithm on Testing the Identity of Boolean Functions in Trace Representation
    Guo, Qian
    Kan, Haibin
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2014, E97D (03): : 583 - 588
  • [27] Average-case Complexity
    Trevisan, Luca
    PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 11 - 11
  • [28] Average-Case Complexity
    Bogdanov, Andrej
    Trevisan, Luca
    FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2006, 2 (01): : 1 - 111
  • [29] An Average-Case Lower Bound Against ACC0
    Chen, Ruiwen
    Oliveira, Igor C.
    Santhanam, Rahul
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 317 - 330
  • [30] AVERAGE-CASE INTERACTIVE COMMUNICATION
    ORLITSKY, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (05) : 1534 - 1547
12345