Abstract
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still open. In this paper restricted parity read-once branching programs are considered and an exponential lower bound on the size of well-structured parity graph-driven read-once branching programs for integer multiplication is proven. This is the first strongly exponential lower bound on the size of a nonoblivious parity read-once branching program model for an explicitly defined boolean function. In addition, more insight into the structure of integer multiplication is yielded.
Supported in part by DFG grant WE 1066.
Chapter PDF
Similar content being viewed by others
References
M. Ajtai. A non-linear time lower bound for boolean branching programs. In Proceedings of the 40th Annual IEEE Symposium on Fountations of Computer Science, pp. 60–70. 1999.
N. Alon and W. Maass. Meanders and their applications in lower bounds arguments. Journal of Computer and System Sciences, 37: 118–129, 1988.
P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proceedings of the 41st Annual IEEE Symposium on Fountations of Computer Science, pp. 169–179. 2000.
P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 2002. To appear.
B. Bollig. Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication. RAIRO Theoretical Informatics and Applications, 35: 149–162, 2001.
B. Bollig, S. Waack, and P. Woelfel. Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. Technical Report TR01–73, Electronic Colloquium on Computational Complexity, 2001.
B. Bollig and P. Woelfel. A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 419–424. 2001.
H. Brosenne, M. Homeister, and S. Waack. Graph-driven free parity BDDs: Algorithms and lower bounds. In Mathematical Foundations of Computer Science: 26th International Symposium, volume 2136 of Lecture Notes in Computer Science, pp. 212–223. 2001.
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35: 677–691, 1986.
R. E. Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication. IEEE Transactions on Computers, 40: 205–213, 1991.
J. Gergov. Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines. Information Processing Letters, 51: 265–269, 1994.
J. Gergov and C. Meinel. Efficient analysis and manipulation of OBDDs can be extended to FBDDs. IEEE Transactions on Computers, 43: 1197–1209, 1994.
M. Krause. Separating ⊕L from L, NL, co-NL, and AL (=P) for oblivious turing machines of linear access time. RAIRO Theoretical Informatics and Applications, 26: 507–522, 1992.
S. Ponzio. A lower bound for integer multiplication with read-once branching programs. SIAM Journal on Computing, 28: 798–815, 1998.
A. Razborov. Lower bounds for deterministic and nondeterministic branching programs. In Proc. of Fundamentals in Computation Theory, volume 529 of Lecture Notes in Computer Science, pp. 47–60. 1991.
P. Savickÿ and D. Sieling. A hierarchy result for read-once branching programs with restricted parity nondeterminism. In Mathematical Foundations of Computer Science: 25th International Symposium, volume 1893 of Lecture Notes in Computer Science, pp. 650–659. 2000.
D. Sieling and I. Wegener. Graph driven BDDs — a new data structure for Boolean functions. Theoretical Computer Science, 141: 283–310, 1995.
J. S. Thathachar. On separating the read-k-times branching program hierarchy. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 653–662. 1998.
I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987.
I. Wegener. Branching Programs and Binary Decision Diagrams — Theory and Applications. SIAM, first edition, 2000.
P. Woelfel. New bounds on the OBDD-size of integer multiplication via universal hashing. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of Lecture Notes in Computer Science, pp. 563–574. 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bollig, B., Waack, S., Woelfel, P. (2002). Parity Graph-Driven Read-Once Branching Programs and An Exponential Lower Bound for Integer Multiplication. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive