Depth of Boolean functions in a complete basis

被引：0

作者：

Lozhkin, SA ^{[1
]}

机构：

[1] MOSCOW MV LOMONOSOV STATE UNIV,MOSCOW,RUSSIA

来源：

VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA | 1996年 / 02期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：80 / 83

页数：4

共 50 条

[21] On average depth of decision trees implementing Boolean functions
Chikalov, I
FUNDAMENTA INFORMATICAE, 2002, 50 (3-4) : 265 - 284
[22] Decomposition of symmetric and partially symmetric boolean functions in a basis of monotone functions
L. B. Avgul’
A. S. Petrochenko
Cybernetics and Systems Analysis, 1998, 34 : 337 - 350
[23] Decomposition of symmetric and partially symmetric Boolean functions in a basis of monotone functions
Avgul, LB
Petrochenko, AS
CYBERNETICS AND SYSTEMS ANALYSIS, 1998, 34 (03) : 337 - 350
[24] On the multiplicative complexity of Boolean functions over the basis (Λ,⊕,1)
Boyar, J
Peralta, R
Pochuev, D
THEORETICAL COMPUTER SCIENCE, 2000, 235 (01) : 43 - 57
[25] Circuit complexity of symmetric Boolean functions in antichain basis
Podolskaya, Olga V.
DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (01): : 31 - 39
[26] An orthogonal basis for functions over a slice of the Boolean hypercube
Filmus, Yuval
ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (01):
[27] Construction of noniterated boolean functions in the basis {&, ∨, −} and estimation of their number
O. V. Zubkov
Russian Mathematics, 2008, 52 (10) : 13 - 19
[28] THERE ARE NO P-COMPLETE FAMILIES OF SYMMETRIC BOOLEAN FUNCTIONS
GEREBGRAUS, M
PATURI, R
SZEMEREDI, E
INFORMATION PROCESSING LETTERS, 1989, 30 (01) : 47 - 49
[29] BOOLEAN FUNCTIONS WITH A LARGE NUMBER OF SUBFUNCTIONS AND SMALL COMPLEXITY AND DEPTH
UHLIG, D
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 395 - 404
[30] RELATING MONOTONE FORMULA SIZE AND MONOTONE DEPTH OF BOOLEAN FUNCTIONS
WEGENER, I
INFORMATION PROCESSING LETTERS, 1983, 16 (01) : 41 - 42

← 1 2 3 4 5 →