To the Problem of Realizability of Boolean Functions by Circuits in a Basis of Unreliable Functional Elements

被引：0

作者：

Tarasov, V. ^{[1
]}

机构：

[1] Ryazan State Radio Engn Acad, Ryazan, Russia

来源：

PROBLEMS OF INFORMATION TRANSMISSION | 2006年 / 42卷 / 02期

关键词：

D O I：

10.1134/S0032946006020086

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Maximal extensions of Post classes containing 0, 1, and x in the algebra of partially unreliable Boolean functions are described. Based on these extensions, criteria of expressibility of Boolean functions by circuits in a basis of partially unreliable elements are proved.

引用

页码：152 / 157

页数：6

共 50 条

[21] Depth of Boolean functions in a complete basis
Lozhkin, SA
VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA, 1996, (02): : 80 - 83
[22] Iterated Boolean Functions in the Elementary Basis
Voronenko, A. A.
Fedorova, V. S.
Chistikov, D. V.
RUSSIAN MATHEMATICS, 2011, 55 (11) : 61 - 65
[23] Depth of Boolean functions in a complete basis
Vestnik Moskovskogo Universiteta, Seriya 1 (Matematika Mekhanika), (02): : 80 - 82
[24] Computing Boolean functions by polynomials and threshold circuits
M. Krause
P. Pudlák
computational complexity, 1998, 7 : 346 - 370
[25] Polynomial Threshold Functions and Boolean Threshold Circuits
Hansen, Kristoffer Arnsfelt
Podolskii, Vladimir V.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 516 - 527
[26] Computing Boolean functions by polynomials and threshold circuits
Krause, M
Pudlák, P
COMPUTATIONAL COMPLEXITY, 1998, 7 (04) : 346 - 370
[27] On the Complexity and Depth of Embedded in Boolean Cube Circuits That Implement Boolean Functions
S. A. Lozhkin
E. L. Dovgalyuk
O. A. Sadovnikov
Moscow University Computational Mathematics and Cybernetics, 2018, 42 (3) : 138 - 144
[28] Polynomial threshold functions and Boolean threshold circuits
Hansen, Kristoffer Arnsfelt
Podolskii, Vladimir V.
INFORMATION AND COMPUTATION, 2015, 240 : 56 - 73
[29] Minimal Contact Circuits for a Sequence of Boolean Functions
N. P. Red’kin
Mathematical Notes, 2021, 110 : 156 - 158
[30] Minimal Contact Circuits for a Sequence of Boolean Functions
Red'kin, N. P.
MATHEMATICAL NOTES, 2021, 110 (1-2) : 156 - 158

← 1 2 3 4 5 →