SUBQUADRATIC SIMULATIONS OF CIRCUITS BY BRANCHING PROGRAMS

被引:5
|
作者
CAI, JY
LIPTON, RJ
机构
关键词
D O I
10.1109/SFCS.1989.63536
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:568 / 573
页数:6
相关论文
共 50 条
  • [21] Arithmetic Branching Programs with Memory
    Mengel, Stefan
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 667 - 678
  • [22] On branching programs with bounded uncertainty
    Jukna, S
    Zák, S
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1998, 1443 : 259 - 270
  • [23] Branching Programs for Tree Evaluation
    Braverman, Mark
    Cook, Stephen
    McKenzie, Pierre
    Santhanam, Rahul
    Wehr, Dustin
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 175 - 186
  • [24] Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
    Kayal, Neeraj
    Nair, Vineet
    Saha, Chandan
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [25] Boolean circuits with a bounded depth of branching
    Cherukhin, DY
    DOKLADY MATHEMATICS, 2005, 72 (03) : 930 - 933
  • [26] RELATION BETWEEN ONE-TIME-ONLY BRANCHING PROGRAMS AND REAL-TIME BRANCHING PROGRAMS
    BEBJAK, A
    STEFANEKOVA, I
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1988, 7 (02): : 107 - 111
  • [27] Pseudorandomness for permutation and regular branching programs
    De, Anindya
    2011 IEEE 26TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2011, : 221 - 231
  • [28] On Algebraic Branching Programs of Small Width
    Bringmann, Karl
    Ikenmeyer, Christian
    Zuiddam, Jeroen
    JOURNAL OF THE ACM, 2018, 65 (05)
  • [29] BOUNDS FOR WIDTH 2 BRANCHING PROGRAMS
    BORODIN, A
    DOLEV, D
    FICH, FE
    PAUL, W
    SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 549 - 560
  • [30] Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
    Kayal, Neeraj
    Nair, Vineet
    Saha, Chandan
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2020, 12 (01)