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 条
  • [31] Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
    Anderson, Matthew
    Forbes, Michael A.
    Saptharishi, Ramprasad
    Shpilka, Amir
    Volk, Ben Lee
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2018, 10 (01)
  • [32] A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
    Bollig, B
    Woelfel, P
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 131 - 142
  • [33] On lower bounds for deterministic parameter estimation
    Forster, P
    Larzabal, P
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 1137 - 1140
  • [34] On Lower Bounds for Nonstandard Deterministic Estimation
    Kbayer, Nabil
    Galy, Jerome
    Chaumette, Eric
    Vincent, Francois
    Renaux, Alexandre
    Larzabal, Pascal
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (06) : 1538 - 1553
  • [35] Comparing the sizes of nondeterministic branching read-k-times programs
    Okol'nishnikova, EA
    DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 205 - 222
  • [36] DETERMINISTIC AND NONDETERMINISTIC COMPUTATION, AND HORN PROGRAMS, ON ABSTRACT-DATA-TYPES
    TUCKER, JV
    ZUCKER, JI
    JOURNAL OF LOGIC PROGRAMMING, 1992, 13 (01): : 23 - 55
  • [37] SEPARATION AND LOWER BOUNDS FOR ROM AND NONDETERMINISTIC MODELS OF PARALLEL COMPUTATION
    LI, M
    YESHA, Y
    INFORMATION AND COMPUTATION, 1987, 73 (02) : 102 - 128
  • [38] On some bounds on the size of branching programs (A survey)
    Okol'nishnikova, EA
    STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2005, 3777 : 107 - 115
  • [39] Lower bounds for general graph-driven read-once parity branching programs
    Brosenne, H
    Homeister, M
    Waack, S
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 290 - 299
  • [40] COMBINATORIAL LOWER BOUND ARGUMENTS FOR DETERMINISTIC AND NONDETERMINISTIC TURING-MACHINES
    MAASS, W
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1985, 292 (02) : 675 - 693
12345