On the complexity of balanced Boolean functions

被引：0

作者：

Institut für Informatik, Technische Universitat Munchen, D-80290 München, Germany ^{[1
]}

机构：

来源：

Inf. Process. Lett. | / 4卷 / 157-163期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[41] Multiplicative complexity of some Boolean functions
Selezneva, Svetlana N.
DISCRETE MATHEMATICS AND APPLICATIONS, 2015, 25 (02): : 101 - 108
[42] The complexity of AND-decomposition of Boolean functions
Emelyanov, Pavel
Ponomaryov, Denis
DISCRETE APPLIED MATHEMATICS, 2020, 280 : 113 - 132
[43] INVERSION COMPLEXITY OF A SYSTEM OF BOOLEAN FUNCTIONS
MARKOV, A
DOKLADY AKADEMII NAUK SSSR, 1963, 150 (03): : 477 - &
[44] THE COMPLEXITY OF BOOLEAN FUNCTIONS IN DIFFERENT CHARACTERISTICS
Gopalan, Parikshit
Lovett, Shachar
Shpilka, Amir
COMPUTATIONAL COMPLEXITY, 2010, 19 (02) : 235 - 263
[45] ON THE POSITIVE AND THE INVERSION COMPLEXITY OF BOOLEAN FUNCTIONS
DICIUNAS, V
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1993, 27 (04): : 283 - 293
[46] On the multiplicative complexity of some Boolean functions
S. N. Selezneva
Computational Mathematics and Mathematical Physics, 2015, 55 : 724 - 730
[47] On the multiplicative complexity of some Boolean functions
Selezneva, S. N.
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2015, 55 (04) : 724 - 730
[48] Perfectly Balanced Boolean Functions and Golic Conjecture
Smyshlyaev, Stanislav V.
JOURNAL OF CRYPTOLOGY, 2012, 25 (03) : 464 - 483
[49] Perfectly Balanced Boolean Functions and Golić Conjecture
Stanislav V. Smyshlyaev
Journal of Cryptology, 2012, 25 : 464 - 483
[50] Complexity of Boolean matrices, graphs, and the boolean functions corresponding to them
Chashkin, A.V.
Discrete Mathematics and Applications, 1994, 4 (03): : 229 - 257

← 1 2 3 4 5 →