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 条
  • [1] SAMPLING LOWER BOUNDS: BOOLEAN AVERAGE-CASE AND PERMUTATIONS
    Viola, Emanuele
    SIAM JOURNAL ON COMPUTING, 2020, 49 (01) : 119 - 137
  • [2] Average-case lower bounds for noisy Boolean decision trees
    Evans, W
    Pippenger, N
    SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 433 - 446
  • [3] AVERAGE-CASE LOWER BOUNDS FOR SEARCHING
    MCDIARMID, C
    SIAM JOURNAL ON COMPUTING, 1988, 17 (05) : 1044 - 1060
  • [4] Bounds for the average-case complexity of monotone Boolean functions
    Chashkin A.V.
    Discrete Mathematics and Applications, 2017, 27 (03): : 137 - 142
  • [5] Average-Case Lower Bounds for the Plurality Problem
    Alonso, Laurent
    Reingold, Edward M.
    ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (03)
  • [6] Average-Case Lower Bounds for Formula Size
    Komargodski, Ilan
    Raz, Ran
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 171 - 180
  • [7] Improved Average-Case Lower Bounds for DeMorgan Formula Size
    Komargodski, Ilan
    Raz, Ran
    Tal, Avishay
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 588 - 597
  • [8] Upper and lower bounds for the average-case complexity of path-search
    Pippenger, N
    NETWORKS, 1999, 33 (04) : 249 - 259
  • [9] STRONG AVERAGE-CASE CIRCUIT LOWER BOUNDS FROM NONTRIVIAL DERANDOMIZATION
    Chen, Lijie
    Ren, Hanlin
    SIAM JOURNAL ON COMPUTING, 2022, 51 (03) : 115 - 173
  • [10] Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
    Chen, Ruiwen
    Santhanam, Rahul
    Srinivasan, Srikanth
    31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
12345