LOWER BOUNDS FOR SYNCHRONOUS CIRCUITS AND PLANAR CIRCUITS

被引：9
|
作者：
TURAN, G [1 ]
机构：
[1] UNIV ILLNOIS,DEPT MATH STAT & COMP SCI,CHICAGO,IL 60637
来源：
INFORMATION PROCESSING LETTERS | 1989年 / 30卷 / 01期
关键词：
D O I：
10.1016/0020-0190(89)90172-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：37 / 40
页数：4
相关论文
共 50 条
  • [31] Lower Bounds for Unrestricted Boolean Circuits: Open Problems
    Kulikov, Alexander S.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018, 2018, 10846 : 15 - 22
  • [32] Lower Bounds: From Circuits to QBF Proof Systems
    Beyersdorff, Olaf
    Bonacina, Ilario
    Chew, Leroy
    ITCS'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INNOVATIONS IN THEORETICAL COMPUTER SCIENCE, 2016, : 249 - 260
  • [33] Lower Bounds and Separations for Constant Depth Multilinear Circuits
    Ran Raz
    Amir Yehudayoff
    computational complexity, 2009, 18 : 171 - 207
  • [34] LOWER BOUNDS AND SEPARATIONS FOR CONSTANT DEPTH MULTILINEAR CIRCUITS
    Raz, Ran
    Yehudayoff, Amir
    COMPUTATIONAL COMPLEXITY, 2009, 18 (02) : 171 - 207
  • [35] Lower Bounds for Arithmetic Circuits via the Hankel Matrix
    Nathanaël Fijalkow
    Guillaume Lagarde
    Pierre Ohlmann
    Olivier Serre
    computational complexity, 2021, 30
  • [36] Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
    Bruno P. Cavalar
    Zhenjian Lu
    Algorithmica, 2023, 85 : 2131 - 2155
  • [37] Some lower bounds of cyclic shift on Boolean circuits
    Tsukiji, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1996, E79A (04) : 520 - 523
  • [38] Lower bounds for modular counting by circuits with modular gates
    D. A. Mix Barrington
    H. Straubing
    computational complexity, 1999, 8 : 258 - 272
  • [39] Lower Bounds for Non-Commutative Skew Circuits
    Limaye, Nutan
    Malod, Guillaume
    Srinivasan, Srikanth
    THEORY OF COMPUTING, 2016, 12
  • [40] Lower bounds for (MOD p MOD m) circuits
    Grolmusz, V
    Tardos, G
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 279 - 288
12345