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 条
  • [21] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
    Glinskih, Ludmila
    Itsykson, Dmitry
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (03) : 613 - 633
  • [22] A LOWER BOUND FOR READ-ONCE-ONLY BRANCHING PROGRAMS
    BABAI, L
    HAJNAL, P
    SZEMEREDI, E
    TURAN, G
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 35 (02) : 153 - 162
  • [23] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
    Glinskih, Ludmila
    Itsykson, Dmitry
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 143 - 155
  • [24] Read-Once Branching Programs for Tree Evaluation Problems
    Iwama, Kazuo
    Nagao, Atsuki
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (01)
  • [25] The distinguishability of product distributions by read-once branching programs
    Steinberger, John
    2013 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2013, : 248 - 254
  • [26] Read-Once Branching Programs for Tree Evaluation Problems
    Iwama, Kazuo
    Nagao, Atsuki
    31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 409 - 420
  • [27] On Computational Power of Quantum Read-Once Branching Programs
    Ablayev, Farid
    Vasiliev, Alexander
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (52): : 1 - 12
  • [28] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
    Ludmila Glinskih
    Dmitry Itsykson
    Theory of Computing Systems, 2021, 65 : 613 - 633
  • [29] Some notes on the information flow in read-once branching programs
    Jukna, S
    Zák, S
    SOFSEM 2000: THEORY AND PRACTICE OF INFORMATICS, 2000, 1963 : 356 - 364
  • [30] The isomorphism problem for read-once branching programs and arithmetic circuits
    Thierauf, T
    CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1998, (01): : 1 - 23
12345