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

中图分类号：

学科分类号：

摘要：

引用

页码：83 / 94

共 50 条

[1] Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Bollig, Beate
Waack, Stephan
Woelfel, Philipp
THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) : 86 - 99
[2] Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Bollig, B
Waack, S
Woelfel, P
FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 83 - 94
[3] 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
[4] A lower bound for integer multiplication with read-once branching programs
Ponzio, S
SIAM JOURNAL ON COMPUTING, 1998, 28 (03) : 798 - 815
[5] 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
[6] A lower bound for integer multiplication on randomized ordered read-once branching programs
Ablayev, F
Karpinski, M
INFORMATION AND COMPUTATION, 2003, 186 (01) : 78 - 89
[7] A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Bollig, B
INFORMATION PROCESSING LETTERS, 2003, 86 (03) : 143 - 148
[8] Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Bollig, B
STACS 2003, PROCEEDINGS, 2003, 2607 : 295 - 306
[9] Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Bollig, B
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2003, 37 (01): : 51 - 66
[10] 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

← 1 2 3 4 5 →