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 条
[31]   Concrete multiplicative complexity of symmetric functions [J].
Boyar, Joan ;
Peralta, Rene .
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 :179-189
[32]   On the modulo degree complexity of Boolean functions [J].
Li, Qian ;
Sun, Xiaoming .
THEORETICAL COMPUTER SCIENCE, 2020, 818 :32-40
[33]   On the Modulo Degree Complexity of Boolean Functions [J].
Li, Qian ;
Sun, Xiaoming .
COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 :384-395
[34]   The Complexity of Boolean Functions in Different Characteristics [J].
Parikshit Gopalan ;
Amir Shpilka ;
Shachar Lovett .
computational complexity, 2010, 19 :235-263
[35]   THE CONJUNCTIVE COMPLEXITY OF QUADRATIC BOOLEAN FUNCTIONS [J].
LENZ, K ;
WEGENER, I .
THEORETICAL COMPUTER SCIENCE, 1991, 81 (02) :257-268
[36]   On the distribution of the spectral complexity of boolean functions [J].
Ryazanov, B.V. .
1600, Publ by VSP Int Sci Publ, Zeist, Netherlands (04)
[37]   On the complexity bounds of restrictions of Boolean functions [J].
Chashkin, AV .
DOKLADY AKADEMII NAUK, 1996, 348 (05) :595-597
[38]   On the Complexity of Minimizing Quasicyclic Boolean Functions [J].
Chukhrov I.P. .
Journal of Applied and Industrial Mathematics, 2018, 12 (03) :426-441
[39]   On the Complexity of Boolean Functions in Different Characteristics [J].
Gopalan, Parikshit ;
Lovett, Shachar ;
Shpilka, Amir .
PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, :173-+
[40]   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
12345