ON THE COMPLEXITY OF PLANAR BOOLEAN CIRCUITS

被引：7

作者：

TURAN, G ^{[1
]}

机构：

[1] HUNGARIAN ACAD SCI, AUTOMATA THEORY RES GRP, H-6720 SZEGED, HUNGARY

来源：

COMPUTATIONAL COMPLEXITY | 1995年 / 5卷 / 01期

关键词：

CIRCUIT COMPLEXITY; PLANAR GRAPHS;

D O I：

10.1007/BF01277954

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider planar circuits, formulas and multilective planar circuits. It is shown that planar circuits and formulas are incomparable. An Omega(n log n) lower bound is given for the multilective planar circuit complexity of a decision problem and an Omega(n(3/2)) lower bound is given for the multilective planar circuit complexity of a multiple output function.

引用

页码：24 / 42

页数：19

共 50 条

[21] The complexity of the descriptiveness of boolean circuits over different sets of gates
Boehler, Elmar
Schnoor, Henning
THEORY OF COMPUTING SYSTEMS, 2007, 41 (04) : 753 - 777
[22] ON THE COMPLEXITY OF REALIZATION OF THE SYMMETRIC BOOLEAN FUNCTIONS BY SWITCHING-CIRCUITS
GRINCHUK, MI
DOKLADY AKADEMII NAUK SSSR, 1989, 309 (04): : 787 - 791
[23] COMPLEXITY CLASSIFICATIONS FOR DIFFERENT EQUIVALENCE AND AUDIT PROBLEMS FOR BOOLEAN CIRCUITS
Boehler, Elmar
Creignou, Nadia
Galota, Matthias
Reith, Steffen
Schnoor, Henning
Vollmer, Heribert
LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (03)
[24] Even Delta-Matroids and the Complexity of Planar Boolean CSPs
Kazda, Alexandr
Kolmogorov, Vladimir
Rolinek, Michal
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 307 - 326
[25] Even Delta-Matroids and the Complexity of Planar Boolean CSPs
Kazda, Alexandr
Kolmogorov, Vladimir
Rolinek, Michal
ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (02)
[26] 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
[27] Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
I. F. Cheburakhin
Journal of Computer and Systems Sciences International, 2006, 45 : 480 - 496
[28] Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
Cheburakhin, I. F.
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2006, 45 (03) : 480 - 496
[29] Complexity of Self-Correcting Circuits for Some Sequence of Boolean Functions
Krasnov, V. M.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2009, 64 (05) : 216 - 218
[30] 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

← 1 2 3 4 5 →