THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS

被引：0
作者：
SCHNORR, CP
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 357卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：45 / 58
页数：14
相关论文
共 50 条
[41]   On a generalization complexity measure for Boolean functions [J].
Franco, L ;
Anthony, M .
2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, :973-978
[42]   Complexity of decision trees for boolean functions [J].
Freivalds, R ;
Miyakawa, M ;
Rosenberg, IG .
33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, :253-255
[43]   RESEARCHING THE COMPLEXITY OF BOOLEAN FUNCTIONS WITH COMPUTERS [J].
Toran, Jacobo ;
Amano, Kazuyuki .
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2010, (101) :64-91
[44]   THE MONOTONE CIRCUIT COMPLEXITY OF BOOLEAN FUNCTIONS [J].
ALON, N ;
BOPPANA, RB .
COMBINATORICA, 1987, 7 (01) :1-22
[45]   The generalized complexity of linear Boolean functions [J].
Redkin, Nikolay P. .
DISCRETE MATHEMATICS AND APPLICATIONS, 2020, 30 (01) :39-44
[46]   Average complexity of symmetric Boolean functions [J].
Chashkin, A.V. .
Vestnik Moskovskogo Universiteta. Ser. 1 Matematika Mekhanika, 2003, (01) :16-20
[47]   The complexity of modular decomposition of Boolean functions [J].
Bioch, JC .
DISCRETE APPLIED MATHEMATICS, 2005, 149 (1-3) :1-13
[48]   On the parity complexity measures of Boolean functions [J].
Zhang, Zhiqiang ;
Shi, Yaoyun .
THEORETICAL COMPUTER SCIENCE, 2010, 411 (26-28) :2612-2618
[49]   ON THE POSITIVE AND THE INVERSION COMPLEXITY OF BOOLEAN FUNCTIONS [J].
DICIUNAS, V .
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1993, 27 (04) :283-293
[50]   INVERSION COMPLEXITY OF A SYSTEM OF BOOLEAN FUNCTIONS [J].
MARKOV, A .
DOKLADY AKADEMII NAUK SSSR, 1963, 150 (03) :477-&
12345