BOUNDS ON THE REALIZATION COMPLEXITY OF BOOLEAN-FORMULAS BY TREE CIRCUITS OF TUNABLE MODULES

被引：0

|

作者：

ARTYUKHOV, VL

KOPEIKIN, GA

SHALYTO, AA

机构：

来源：

AUTOMATION AND REMOTE CONTROL | 1981年 / 42卷 / 11期

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：1532 / 1538

页数：7

相关论文

共 21 条

[1] STRUCTURED APPROACH TO SOFTWARE REALIZATION OF BOOLEAN-FORMULAS
KUZNETSOV, BP
SHALYTO, AA
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1985, (05): : 84 - 88
[2] THE COMPLEXITY OF VERY SIMPLE BOOLEAN-FORMULAS WITH APPLICATIONS
HUNT, HB
STEARNS, RE
SIAM JOURNAL ON COMPUTING, 1990, 19 (01) : 44 - 70
[3] OMEGA(N LOG N) LOWER BOUNDS ON LENGTH OF BOOLEAN-FORMULAS
FISCHER, MJ
MEYER, AR
PATERSON, MS
SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 416 - 427
[4] LOWER BOUNDS FOR BOOLEAN-FORMULAS OF DEPTH-3 AND THE TOPOLOGY OF THE N-CUBE
KRIEGEL, K
WAACK, S
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 227 - 233
[5] LOWER BOUNDS ON THE AREA COMPLEXITY OF BOOLEAN CIRCUITS
HROMKOVIC, J
LOZKIN, SA
RYBKO, AI
SAPOZENKO, AA
SKALIKOVA, NA
THEORETICAL COMPUTER SCIENCE, 1992, 97 (02) : 285 - 300
[6] ON THE COMPLEXITY OF REALIZATION OF THE SYMMETRIC BOOLEAN FUNCTIONS BY SWITCHING-CIRCUITS
GRINCHUK, MI
DOKLADY AKADEMII NAUK SSSR, 1989, 309 (04): : 787 - 791
[7] On the complexity of realization of the linear function by formulas over finite Boolean bases
2000, VSP BV, Zeist, Netherlands (10):
[8] LOWER BOUNDS FOR THE COMPLEXITY OF RELIABLE BOOLEAN CIRCUITS WITH NOISY GATES
GACS, P
GAL, A
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (02) : 579 - 583
[9] Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Cherukhin, D. Yu.
DISCRETE MATHEMATICS AND APPLICATIONS, 2011, 21 (04): : 499 - 508
[10] Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity
Forbes, Michael A.
Kumar, Mrinal
Saptharishi, Ramprasad
31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50