RELIABLE NETWORKS FOR BOOLEAN FUNCTIONS WITH SMALL COMPLEXITY

被引：0

|

作者：

UHLIG, D

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 342卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：366 / 371

页数：6

相关论文

共 50 条

[1] COMPLEXITY OF IMPLEMENTING BOOLEAN FUNCTIONS IN ITERATIVE NETWORKS
MAKAREVSKII, AY
AUTOMATION AND REMOTE CONTROL, 1973, 34 (05) : 773 - 780
[2] Asymptotics for the Complexity of Boolean Functions with Small Number of Ones
N. P. Red’kin
Mathematical Notes, 2021, 109 : 256 - 261
[3] Asymptotics for the Complexity of Boolean Functions with Small Number of Ones
Red'kin, N. P.
MATHEMATICAL NOTES, 2021, 109 (1-2) : 256 - 261
[4] Implementation complexity of Boolean functions with a small number of ones
Redkin, Nikolay P.
DISCRETE MATHEMATICS AND APPLICATIONS, 2021, 31 (04): : 271 - 279
[5] Quantum Query Complexity of Boolean Functions with Small On-Sets
Ambainis, Andris
Iwama, Kazuo
Nakanishi, Masaki
Nishimura, Harumichi
Raymond, Rudy
Tani, Seiichiro
Yamashita, Shigeru
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 907 - +
[6] Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
Mestetskiy, Mikhail A.
Shupletsov, Mikhail S.
DISCRETE MATHEMATICS AND APPLICATIONS, 2024, 34 (04): : 211 - 219
[7] Comparative analysis of the complexity of boolean functions with a small number of zeros
Maximov, Yu. V.
DOKLADY MATHEMATICS, 2012, 86 (03) : 854 - 856
[8] Comparative analysis of the complexity of boolean functions with a small number of zeros
Yu. V. Maximov
Doklady Mathematics, 2012, 86 : 854 - 856
[9] BOOLEAN FUNCTIONS WITH A LARGE NUMBER OF SUBFUNCTIONS AND SMALL COMPLEXITY AND DEPTH
UHLIG, D
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 395 - 404
[10] On the complexity of balanced Boolean functions
Institut für Informatik, Technische Universitat Munchen, D-80290 München, Germany
Inf. Process. Lett., 4 (157-163):

← 1 2 3 4 5 →