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 条

[1] Parallel complexity of random Boolean circuits
Machta, J.
DeDeo, S.
Mertens, S.
Moore, C.
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2011,
[2] THE PARALLEL COMPLEXITY OF PROPAGATION IN BOOLEAN CIRCUITS
SUBRAMANIAN, A
INFORMATION AND COMPUTATION, 1995, 117 (02) : 266 - 275
[3] COMPLEXITY BASED ON PARTITIONING OF BOOLEAN CIRCUITS AND THEIR RELATION TO MULTIVALUED CIRCUITS
MARUOKA, A
IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (02) : 115 - 123
[4] 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
[5] Boolean circuits, tensor ranks, and communication complexity
Pudlak, P
Rodl, V
Sgall, J
SIAM JOURNAL ON COMPUTING, 1997, 26 (03) : 605 - 633
[6] 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
[7] The complexity of planar Boolean #CSP with complex weights
Guo, Heng
Williams, Tyson
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 107 : 1 - 27
[8] The Complexity of Planar Boolean #CSP with Complex Weights
Guo, Heng
Williams, Tyson
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 516 - 527
[9] Switching Activity of Boolean Circuits and Synthesis of Boolean Circuits with Asymptotically Optimal Complexity and Linear Switching Activity
Lozhkin, S. A.
Shupletsov, M. S.
LOBACHEVSKII JOURNAL OF MATHEMATICS, 2015, 36 (04) : 450 - 460
[10] Order of power of planar circuits implementing Boolean functions
Kalachev, Gleb V.
DISCRETE MATHEMATICS AND APPLICATIONS, 2014, 24 (04): : 185 - 205

← 1 2 3 4 5 →