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 条
  • [21] Lower bounds for the sum of small-size algebraic branching programs
    Bhargav, C.S.
    Dwivedi, Prateek
    Saxena, Nitin
    Theoretical Computer Science, 2025, 1041
  • [22] Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
    Bollig, B
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (02): : 149 - 162
  • [23] Efficient Conversion of Boolean Circuits to Nondeterministic Branching Programs
    Ben Asher, Yosi
    Tartakovsky, Vladislav
    2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 655 - 662
  • [24] Deterministic versus nondeterministic time and lower bound problems
    Stearns, RE
    JOURNAL OF THE ACM, 2003, 50 (01) : 91 - 95
  • [25] Low-deterministic security for low-nondeterministic programs
    Bischof, Simon
    Breitner, Joachim
    Graf, Juergen
    Hecker, Martin
    Mohr, Martin
    Snelting, Gregor
    JOURNAL OF COMPUTER SECURITY, 2018, 26 (03) : 335 - 366
  • [26] BOUNDS FOR WIDTH 2 BRANCHING PROGRAMS
    BORODIN, A
    DOLEV, D
    FICH, FE
    PAUL, W
    SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 549 - 560
  • [27] Finding lower bounds for nondeterministic state complexity is hard
    Gruber, Hermann
    Holzer, Markus
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 363 - 374
  • [28] A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
    Beate Bollig
    Philipp Woelfel
    Theory of Computing Systems, 2005, 38 : 671 - 685
  • [29] Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
    Anderson, Matthew
    Forbes, Michael A.
    Saptharishi, Ramprasad
    Shpilka, Amir
    Volk, Ben Lee
    31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
  • [30] A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
    Bollig, B
    Woelfel, P
    THEORY OF COMPUTING SYSTEMS, 2005, 38 (06) : 671 - 685
12345