Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication

被引：0
|
作者：
Bollig, Beate [1 ]
Waack, Stephan [2 ]
Woelfel, Philipp [1 ]
机构：
[1] FB Informatik, LS2, Univ. Dortmund, Germany
[2] Institut für Numerische und Angewandte Mathematik, Georg-August-Universität Gottingen, Germany
来源：
IFIP Advances in Information and Communication Technology | 2002年 / 96卷
关键词：
∗Corresponding author. Department of Computer Science; University of Toronto; 10 King’s College Road; Toronto; Ont; Canada M5S 3G4. Tel.: +1 416 946 8792. E-mail addresses: bollig@ls2.cs.uni-dortmund.de (B. Bollig); waack@math.uni-goettingen.de; (S; Waack); woelfel@gmx.net; woelfel@ls2.cs.uni-dortmund.de (P. Woelfel). 1Supported in part by DFG We 1066/9. 2Supported in part by DFG We 1066/10;
D O I：
10.1007/978-0-387-35608-2_8
中图分类号：
学科分类号：
摘要：
21
引用
收藏
页码：83 / 94
相关论文
共 50 条
  • [41] Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs
    Gurjar, Rohit
    Korwar, Arpita
    Saxena, Nitin
    Thierauf, Thomas
    30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 323 - 346
  • [42] Graph-driven free parity BDDs: Algorithms and lower bounds
    Brosenne, H
    Homeister, M
    Waack, S
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 212 - 223
  • [43] Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
    Rohit Gurjar
    Arpita Korwar
    Nitin Saxena
    Thomas Thierauf
    computational complexity, 2017, 26 : 835 - 880
  • [44] Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
    Gurjar, Rohit
    Korwar, Arpita
    Saxena, Nitin
    Thierauf, Thomas
    COMPUTATIONAL COMPLEXITY, 2017, 26 (04) : 835 - 880
  • [45] A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy
    Arnold, Stefan
    Toran, Jacobo
    UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 119 - 128
  • [46] Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
    Alexander Razborov*
    Avi Wigderson†
    Andrew Yao‡
    Combinatorica, 2002, 22 : 555 - 574
  • [47] Functions that have read-once branching programs of quadratic size are not necessarily testable
    Bollig, B
    Wegener, I
    INFORMATION PROCESSING LETTERS, 2003, 87 (01) : 25 - 29
  • [48] Hitting Sets for Multilinear Read-Once Algebraic Branching Programs, in any Order
    Forbes, Michael A.
    Saptharishi, Ramprasad
    Shpilka, Amir
    STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 867 - 875
  • [49] Proofs of proximity for context-free languages and read-once branching programs
    Goldreich, Oded
    Gur, Tom
    Rothblum, Ron D.
    INFORMATION AND COMPUTATION, 2018, 261 : 175 - 201
  • [50] Hitting Sets with Near-Optimal Error for Read-Once Branching Programs
    Braverman, Mark
    Cohen, Gil
    Garg, Sumegha
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 353 - 362
12345