Beate Bollig
ABSTRACT
Branching programs (BPs) are a well-established computation and representation model for Boolean functions. Especially read-once branching programs (BP1s) have been studied intensively. Exponential lower bounds on the BP1 complexity of explicit functions have been known for a long time. Nevertheless, the proof of exponential lower bounds on the read-once branching program size of selected functions is sometimes difficult. Motivated by the applications the BP1 complexity of fundamental functions is of interest. It took quite a long time until Ponzio [16, 17] was able to prove a bound of 2^{Ω(\sqrt{n})} for integer multiplication. Combining results and methods for universal hashing with lower bound techniques for BP1s a lower bound of Ω(2^{n/4}) on the size of BP1s for integer multiplication is presented in this paper.
- 1.M.Ajtai.A non-linear time lower bound for boolean branching programs.In Proc.of 40th FOCS pages 60 -70,2000.]] Google Scholar
Digital Library
- 2.M.Ajtai,L.Babai,P.Hajnal,J.Komlos,P.Pudlak, V.Rodl,E.Szemeredi,and G.Turan.Two lower bounds for branching programms.In Proc. 18th STOC pages 30 -38,1986.]] Google ScholarDigital Library
- 3.N.Alon,M.Dietzfelbinger,P.Miltersen,E.Petrank, and G.Tardos.Linear hash functions.Journal of the ACM 46:667 -683,1999.]] Google ScholarDigital Library
- 4.N.Alon and W.Maass.Meanders and their applications in lower bound arguments.Journal of Computer and System Sciences 37:118 -129,1988.]] Google ScholarDigital Library
- 5.A.Andreev,J.Baskov,E.Clementi,and R.Rolim. Small pseudo-random sets yield hard functions:new tight explicit lower bounds for branching programs.In Proc. of ICALP volume 1644 of Lecture Notes in Computer Science pages 179 -189,1999.]] Google ScholarDigital Library
- 6.P.Beame,M.Saks,X.Sun,and E.Vee.Super-linear time-space tradeo .lower bounds for randomized computation.In Proc. 41st FOCS 2000.]] Google ScholarDigital Library
- 7.B.Bollig.Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication.In Proc. 25th MFCS volume 1893 of Lecture Notes of Computer Science pages 222 -231,2000.]] Google ScholarDigital Library
- 8.B.Bollig and I.Wegener.Read-once projections and formal circuit veri .cation with binary decision diagrams.In Proc. 23rd STACS volume 1046 of Lecture Notes of Computer Science pages 491 -502, 1996.]] Google ScholarDigital Library
- 9.R.E.Bryant.Graph-based algorithms for boolean manipulation.IEEE Trans. on Computers 35:677 -691,1986.]] Google ScholarDigital Library
- 10.R.E.Bryant.On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. on Computers 40:205 -213,1991.]] Google ScholarDigital Library
- 11.M.Dietzfelbinger.Universal hashing and k -wise independent random variables via integer arithmetic without primes.In Proc. 13th STACS volume 1046 of Lecture Notes in Computer Science pages 569 -580, 1996.]] Google ScholarDigital Library
- 12.M.Dietzfelbinger,T.Hagerup,J.Katajainen,and M.Penttonen.A reliable randomized algorithm for the closest-pair problem.Journal of Algorithms 25:19 -51,1997.]] Google ScholarDigital Library
- 13.J.Gergov.Time-space trade-o .s for integer multiplication on various types of input oblivious sequential machines.Information Processing Letters 51:265 -269,1994.]] Google ScholarDigital Library
- 14.A.Hajnal,W.Maass,P.Pudlak,and G.Turan. Threshold circuits of bounded depth.In Proc. 28th FOCS pages 99 -110,1987.]]Google Scholar
- 15.K.Kriegel and S.Waack.Lower bounds on the complexity of real-time branching programs.In Proc. FCT volume 278 of Lecture Notes in Computer Science pages 263 -267,1987.]] Google ScholarDigital Library
- 16.S.Ponzio.A lower bound for integer multiplication with read-once branching programs.In Proc. 27th STOC pages 130 -139,1995.]] Google ScholarDigital Library
- 17.S.Ponzio.A lower bound for integer multiplication with read-once branching programs.SIAM Journal on Computing 28:798 -815,1998.]] Google ScholarDigital Library
- 18.P.Savicky and S.cZak.A read-once lower bound and a (1,+k )-hierarchy for branching programs.Theoretical Computer Science 238:347 -362,2000.]] Google ScholarDigital Library
- 19.D.Sieling and I.Wegener.Graph driven BDDs -a new data structure for boolean functions.Theoretical Computer Science 141:283 -310,1995.]] Google ScholarDigital Library
- 20.J.Simon and M.Szegedy.A new lower bound theorem for read-only-once branching programs and its applications.In Advances in Computational Complexity Theory (ed. J. Cai),volume13of DIMACS Series in Discrete Mathematics and Theoretical Computer Science pages 183 -193,1993.]]Google Scholar
- 21.S. Zak. An exponential lower bound for one-time-only branching programs.In Proc. 9th MFCS volume 176 of Lecture Notes in Computer Science pages 562 -566, 1984.]] Google ScholarDigital Library
- 22.I.Wegener.The Complexity of Boolean Functions Wiley-Teubner,1987.]] Google ScholarDigital Library
- 23.I.Wegener.On the complexity of branching programs and decision trees for clique functions.Journal of the ACM 35:461 -471,1988.]] Google ScholarDigital Library
- 24.I.Wegener.Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions.Information Processing Letters 46:85 -87, 1993.]] Google ScholarDigital Library
- 25.P.Woelfel.E .cient strongly universal and optimally universal hashing.In Proc. 24th MFCS volume 1672 of Lecture Notes in Computer Science pages 262 -272, 1999.]] Google ScholarDigital Library
- 26.P.Woelfel.Klassen universeller Hashfunktionen mit ganzzahliger Arithmetik Diploma thesis,Univ. Dortmund,2000.]]Google Scholar
- 27.P.Woelfel.New bounds on the OBDD-size of integer multiplication via universal hashing.In Proc. of 18th STACS volume 2010 of Lecture Notes in Computer Science pages 563 -574,2001.]] Google ScholarDigital Library
Index Terms
- A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing
Recommendations
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Branching programs are a well-established computation model for Boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for read-once branching programs are known for a long time. On the other ...
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Branching programs are a well-established computation model for Boolean functions, especially read-once branching programs (BP1s) have been studied intensively. A very simple function f in n2 variables is exhibited such that both the function f and its ...
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism
CCC '02: Proceedings of the 17th IEEE Annual Conference on Computational ComplexityBranching Programs (BPs) are a well-established computation and representation model for Boolean functions. Although exponential lower bounds for restricted BPs such as Read-Once Branching Programs (BP1s) have been known for a long time, the proof of ...
Comments