LOWER BOUNDS FOR DETERMINISTIC AND NONDETERMINISTIC BRANCHING PROGRAMS

被引：0
|
作者：
RAZBOROV, AA
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 529卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We survey lower bounds established for the complexity of computing explicitly given Boolean functions by switching-and-rectifier networks, branching programs and switching networks. We first consider the unrestricted case and then proceed to various restricted models. Among these are monotone networks, bounded-width devices*, oblivious devices and read-k times only devices.
引用
收藏
页码：47 / 60
页数：14
相关论文
共 50 条
  • [41] A LOWER BOUND ON COMPLEXITY OF BRANCHING PROGRAMS
    PUDLAK, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 176 : 480 - 489
  • [42] Upper and Lower Bounds for Deterministic Approximate Objects
    Hendler, Danny
    Khattabi, Adnane
    Milani, Alessia
    Travers, Corentin
    2021 IEEE 41ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2021), 2021, : 438 - 448
  • [43] Lower Bounds for Haar Projections: Deterministic Examples
    Andreas Seeger
    Tino Ullrich
    Constructive Approximation, 2017, 46 : 227 - 242
  • [44] Computable lower bounds for deterministic parameter estimation
    Chaumette, Eric
    Galy, Jerome
    Vincent, Francois
    Larzabal, Pascal
    2007 2ND IEEE INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING, 2007, : 237 - +
  • [45] Lower Bounds for Haar Projections: Deterministic Examples
    Seeger, Andreas
    Ullrich, Tino
    CONSTRUCTIVE APPROXIMATION, 2017, 46 (02) : 227 - 242
  • [46] No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth
    Razgon, Igor
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 319 - 331
  • [47] BRANCHING PROGRAMS AS A TOOL FOR PROVING LOWER BOUNDS ON VLSI COMPUTATIONS AND OPTIMAL-ALGORITHMS FOR SYSTOLIC ARRAYS
    HROMKOVIC, J
    PROCHAZKA, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 360 - 370
  • [48] GRADUALLY INTRACTABLE PROBLEMS AND NONDETERMINISTIC LOG-SPACE LOWER BOUNDS
    KASAI, T
    IWATA, S
    MATHEMATICAL SYSTEMS THEORY, 1985, 18 (02): : 153 - 170
  • [49] Lower Runtime Bounds for Integer Programs
    Frohn, F.
    Naaf, M.
    Hensel, J.
    Brockschmidt, M.
    Giesl, J.
    AUTOMATED REASONING (IJCAR 2016), 2016, 9706 : 550 - 567
  • [50] LOWER BOUNDS FOR CONVEX-PROGRAMS
    SCOTT, CH
    JEFFERSON, TR
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1982, 13 (10) : 1109 - 1115
12345