Average-case complexity of elementary Boolean functions

被引：0

作者：

Chashkin, A.V.

机构：

来源：

Discrete Mathematics and Applications | 2001年 / 11卷 / 01期

关键词：

D O I：

10.1515/dma.2001.11.1.71

中图分类号：

学科分类号：

摘要：

引用

页码：71 / 81

共 50 条

[1] Average-case complexity of partial Boolean functions
Chashkin, A
STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, 2003, 2827 : 146 - 156
[2] Bounds for the average-case complexity of monotone Boolean functions
Chashkin A.V.
Discrete Mathematics and Applications, 2017, 27 (03): : 137 - 142
[3] 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
[4] On the average-case complexity of underdetermined functions
Chashkin, Aleksandr V.
DISCRETE MATHEMATICS AND APPLICATIONS, 2018, 28 (04): : 201 - 221
[5] On derandomization and average-case complexity of monotone functions
Karakostas, George
Kinne, Jeff
van Melkebeek, Dieter
THEORETICAL COMPUTER SCIENCE, 2012, 434 : 35 - 44
[6] Average-case Complexity
Trevisan, Luca
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 11 - 11
[7] Average-Case Complexity
Bogdanov, Andrej
Trevisan, Luca
FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2006, 2 (01): : 1 - 111
[8] Average case complexity for finite Boolean functions
Chashkin, AV
DISCRETE APPLIED MATHEMATICS, 2001, 114 (1-3) : 43 - 59
[9] Average-case analysis of classification algorithms for Boolean functions and decision trees
Scheffer, T
ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2000, 1968 : 194 - 208
[10] On the average-case complexity of Shellsort
Vitanyi, Paul
RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 354 - 363

← 1 2 3 4 5 →