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

Theoretical Computer Science ◽

10.1016/j.tcs.2006.05.035 ◽

2006 ◽

Vol 362 (1-3) ◽

pp. 86-99 ◽

Author(s):

Beate Bollig ◽

Stephan Waack ◽

Philipp Woelfel

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication ◽

Exponential Lower Bound

Download Full-text

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

RAIRO - Theoretical Informatics and Applications ◽

10.1051/ita:2001113 ◽

2001 ◽

Vol 35 (2) ◽

pp. 149-162 ◽

Author(s):

Beate Bollig

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication ◽

Exponential Lower Bound

Download Full-text

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2000 ◽

10.1007/3-540-44612-5_18 ◽

2000 ◽

pp. 222-231 ◽

Author(s):

Beate Bollig

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication ◽

Exponential Lower Bound

Download Full-text

Parity Graph-Driven Read-Once Branching Programs and An Exponential Lower Bound for Integer Multiplication

Foundations of Information Technology in the Era of Network and Mobile Computing ◽

10.1007/978-0-387-35608-2_8 ◽

2002 ◽

pp. 83-94 ◽

Author(s):

Beate Bollig ◽

Stephan Waack ◽

Philipp Woelfel

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication ◽

Exponential Lower Bound

Download Full-text

An exponential lower bound for real-time branching programs

Information and Control ◽

10.1016/s0019-9958(86)80018-3 ◽

1986 ◽

Vol 71 (1-2) ◽

pp. 87-94 ◽

Author(s):

Stanislav ák

Keyword(s):

Lower Bound ◽

Real Time ◽

Branching Programs ◽

Exponential Lower Bound

Download Full-text

A Lower Bound for Integer Multiplication with Read-Once Branching Programs

SIAM Journal on Computing ◽

10.1137/s0097539795290349 ◽

1998 ◽

Vol 28 (3) ◽

pp. 798-815 ◽

Author(s):

Stephen Ponzio

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication

Download Full-text

An exponential lower bound for one-time-only branching programs

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030340 ◽

1984 ◽

pp. 562-566 ◽

Author(s):

Stanislav Žák

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Exponential Lower Bound

Download Full-text

A lower bound for integer multiplication on randomized ordered read-once branching programs

Information and Computation ◽

10.1016/s0890-5401(03)00118-4 ◽

2003 ◽

Vol 186 (1) ◽

pp. 78-89 ◽

Author(s):

Farid Ablayev ◽

Marek Karpinski

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication

Download Full-text

A lower bound for integer multiplication with read-once branching programs

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225098 ◽

1995 ◽

Author(s):

Stephen Ponzio

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Integer Multiplication

Download Full-text

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2004.04.007 ◽

2004 ◽

Vol 69 (3) ◽

pp. 395-420 ◽

Author(s):

Iordanis Kerenidis ◽

Ronald de Wolf

Keyword(s):

Lower Bound ◽

Locally Decodable Codes ◽

Locally Decodable ◽

Exponential Lower Bound

Download Full-text

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897653 ◽

2016 ◽

Author(s):

Amir Abboud ◽

Thomas Dueholm Hansen ◽

Virginia Vassilevska Williams ◽

Ryan Williams

Keyword(s):

Lower Bound ◽

Edit Distance ◽

Branching Programs

Download Full-text