Average-case complexity of elementary Boolean functions

被引：0
|
作者：
Chashkin, A.V.
机构：
来源：
Discrete Mathematics and Applications | 2001年 / 11卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The disjunction, conjunction, and linear function, each depending on an increasing number of arguments, are computed by straight-line programs with a conditional stop. Asymptotically exact formulas for the average-case complexity of these functions are found. It is shown that the average-case complexities of disjunction and conjunction are constants and the average-case complexity of the linear function coincides with its circuit size. © VSP 2001.
引用
收藏
页码：71 / 81
相关论文
共 50 条
  • [21] Average complexity of symmetric Boolean functions
    Chashkin, A.V.
    Vestnik Moskovskogo Universiteta. Ser. 1 Matematika Mekhanika, 2003, (01): : 16 - 20
  • [22] An average-case depth hierarchy theorem for Boolean circuits
    Rossman, Benjamin
    Servedio, Rocco A.
    Tan, Li-Yang
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 1030 - 1048
  • [23] INTEGRATION AND APPROXIMATION OF MULTIVARIATE FUNCTIONS - AVERAGE-CASE COMPLEXITY WITH ISOTROPIC WIENER MEASURE
    WASILKOWSKI, GW
    JOURNAL OF APPROXIMATION THEORY, 1994, 77 (02) : 212 - 227
  • [24] SAMPLING LOWER BOUNDS: BOOLEAN AVERAGE-CASE AND PERMUTATIONS
    Viola, Emanuele
    SIAM JOURNAL ON COMPUTING, 2020, 49 (01) : 119 - 137
  • [25] An Average-Case Depth Hierarchy Theorem for Boolean Circuits
    Hastad, Johan
    Rossman, Benjamin
    Servedio, Rocco A.
    Tan, Li-Yang
    JOURNAL OF THE ACM, 2017, 64 (05)
  • [26] On the average-case complexity of pattern matching with wildcards
    Barton, Carl
    THEORETICAL COMPUTER SCIENCE, 2022, 922 : 37 - 45
  • [27] On the Average-Case Complexity of MCSP and Its Variants
    Hirahara, Shuichi
    Santhanam, Rahul
    32ND COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2017), 2017, 79
  • [28] The Complexity of Average-Case Dynamic Subgraph Counting
    Henzinger, Monika
    Lincoln, Andrea
    Saha, Barna
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 459 - 498
  • [29] Sampling lower bounds: Boolean average-case and permutations
    Viola, Emanuele
    SIAM Journal on Computing, 2020, 49 (01): : 119 - 137
  • [30] List decoding in average-case complexity and pseudorandomness
    Guruswami, Venkatesan
    2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 32 - 36
12345