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 条

[1] On the complexity of balanced Boolean functions
Bernasconi, A
ALGORITHMS AND COMPLEXITY, 1997, 1203 : 253 - 263
[2] On the complexity of balanced Boolean functions
Bernasconi, A
INFORMATION PROCESSING LETTERS, 1999, 70 (04) : 157 - 163
[3] Balanced Boolean functions
Chakrabarty, K
Hayes, JP
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1998, 145 (01): : 52 - 62
[4] On the Multiplicative Complexity of Boolean Functions
Selezneva, Svetlana N.
FUNDAMENTA INFORMATICAE, 2016, 145 (03) : 399 - 404
[5] THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS
WEGENER, I
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 270 : 433 - 442
[6] Computational complexity of Boolean functions
Korshunov, A. D.
RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) : 93 - 165
[7] THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS
SCHNORR, CP
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 45 - 58
[8] On cryptographic complexity of Boolean functions
Carlet, C
FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
[9] On a conjecture for balanced symmetric Boolean functions
Cusick, Thomas W.
Li, Yuan
Stanica, Pantelimon
JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2009, 3 (04) : 273 - 290
[10] THE VLSI COMPLEXITY OF BOOLEAN FUNCTIONS
KRAMER, MR
VANLEEUWEN, J
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 171 : 397 - 407

← 1 2 3 4 5 →