THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS

被引：0

|

作者：

WEGENER, I

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1987年 / 270卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：433 / 442

页数：10

相关论文

共 50 条

[1] LOWER BOUNDS TO THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS
BABAI, L
PUDLAK, P
RODL, V
SZEMEREDI, E
[J]. THEORETICAL COMPUTER SCIENCE, 1990, 74 (03) : 313 - 323
[2] LOWER BOUNDS OF THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS OF CONTACT-RECTIFIER CIRCUITS
RAZBOROV, AA
[J]. MATHEMATICAL NOTES, 1990, 48 (5-6) : 1226 - 1234
[3] ON THE BENT BOOLEAN FUNCTIONS THAT ARE SYMMETRICAL
SAVICKY, P
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 1994, 15 (04) : 407 - 410
[4] A 4-NORMAL LOWER BOUND ON THE COMBINATIONAL COMPLEXITY OF CERTAIN SYMMETRICAL BOOLEAN FUNCTIONS OVER THE BASIS OF UNATE DYADIC BOOLEAN FUNCTIONS
ZWICK, U
[J]. SIAM JOURNAL ON COMPUTING, 1991, 20 (03) : 499 - 505
[5] POLYNOMIAL EXPANSION OF SYMMETRICAL BOOLEAN FUNCTIONS
SUPRUN, VP
[J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1985, 23 (06): : 88 - 92
[6] On the Multiplicative Complexity of Boolean Functions
Selezneva, Svetlana N.
[J]. FUNDAMENTA INFORMATICAE, 2016, 145 (03) : 399 - 404
[7] On cryptographic complexity of Boolean functions
Carlet, C
[J]. FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
[8] THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS
SCHNORR, CP
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 45 - 58
[9] Computational complexity of Boolean functions
Korshunov, A. D.
[J]. RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) : 93 - 165
[10] On the complexity of balanced Boolean functions
Bernasconi, A
[J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 253 - 263

← 1 2 3 4 5 →