Comparative analysis of the complexity of boolean functions with a small number of zeros

被引：2

|

作者：

Maximov, Yu. V. ^{[1
]}

机构：

[1] Moscow Inst Phys & Technol, Dolgoprudnyi 141700, Moscow Oblast, Russia

来源：

DOKLADY MATHEMATICS | 2012年 / 86卷 / 03期

关键词：

Boolean Function; Reference Object; Conjunctive Normal Form; Disjunctive Normal Form; Complete Function;

D O I：

10.1134/S1064562412060051

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：854 / 856

页数：3

相关论文

共 50 条

[41] Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions
V. Grolmusz
Algorithmica, 1999, 23 : 341 - 353
[42] Sign-representation of Boolean functions using a small number of monomials
Oztop, Erhan
NEURAL NETWORKS, 2009, 22 (07) : 938 - 948
[43] ON THE COMPLEXITY OF ANALYSIS AND MANIPULATION OF BOOLEAN FUNCTIONS IN TERMS OF DECISION GRAPHS
GERGOV, J
MEINEL, C
INFORMATION PROCESSING LETTERS, 1994, 50 (06) : 317 - 322
[44] PSEUDO-BOOLEAN FUNCTIONS AND THE MULTIPLICITY OF THE ZEROS OF POLYNOMIALS
Erdelyi, Tamas
JOURNAL D ANALYSE MATHEMATIQUE, 2015, 127 : 91 - 108
[45] On the Modulo Degree Complexity of Boolean Functions
Li, Qian
Sun, Xiaoming
COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 384 - 395
[46] On the modulo degree complexity of Boolean functions
Li, Qian
Sun, Xiaoming
THEORETICAL COMPUTER SCIENCE, 2020, 818 (818) : 32 - 40
[47] The Complexity of Boolean Functions in Different Characteristics
Parikshit Gopalan
Amir Shpilka
Shachar Lovett
computational complexity, 2010, 19 : 235 - 263
[48] THE CONJUNCTIVE COMPLEXITY OF QUADRATIC BOOLEAN FUNCTIONS
LENZ, K
WEGENER, I
THEORETICAL COMPUTER SCIENCE, 1991, 81 (02) : 257 - 268
[49] On the distribution of the spectral complexity of boolean functions
Ryazanov, B.V.
1600, Publ by VSP Int Sci Publ, Zeist, Netherlands (04):
[50] On the complexity bounds of restrictions of Boolean functions
Chashkin, AV
DOKLADY AKADEMII NAUK, 1996, 348 (05) : 595 - 597

← 1 2 3 4 5 →