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

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 798-815

  Ponzio, Stephen ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

BDD; Branching programs; Multiplication; Read once; Verification

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL CIRCUITS; COMPUTATIONAL METHODS; DECISION TABLES; DIGITAL ARITHMETIC; GRAPH THEORY;

BINARY DECISION DIAGRAMS; BRANCHING PROGRAMS; HARDWARE VERIFICATION; INTEGER MULTIPLICATION;

INTEGER PROGRAMMING;

EID: 0032255107     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539795290349     Document Type: Article

References (47)

1. [AGD91] P. ASHAR, A. GHOSH, AND S. DEVADAS, Boolean satisfiability and equivalence checking using general binary decision diagrams, in Proc. Int'l. Conference on Computer Design, Boston, 1991, IEEE, pp. 259-264.
2. [AM88] N. ALON AND W. MAASS, Meanders and their applications in lower bounds arguments, J. Comput. System Sci., 37 (1988), pp. 118-129.
3. [BC94] R. BRYANT AND Y. CHEN, Verification of Arithmetic Functions with Binary Moment Diagrams, Tech. report CMU-CS-94-160, Carnegie Mellon University, Pittsburgh, PA, 1994.
4. [BCW80] M. BLUM, A. CHANDRA, AND M. WEGMAN, Equivalence of free boolean graphs can be decided probabilistically in polynomial time, Inform. Process. Lett., 10 (1980), pp. 80-82.
5. [BF85] F. BRGLEZ AND H. FUJIWARA, A neutral netlist of 10 combinational circuits, in Proc. 1985 IEEE Int'l. Symposium on Circuits and Systems.
6. [BHR95] Y. BREITBART, H. B. HUNT, III, AND D. ROSENKRANTZ, On the size of binary decision diagrams representing Boolean functions, Theoret. Comput. Sci., 145 (1995), pp. 45-69.
7. [BHST87] L. BABAI, A. HAJNAL, E. SZEMEREDI, AND G. TURAN, A lower bound for read-once branching programs, J. Comput. System Sci., 37 (1988), pp. 153-162.
8. [Br91] R. BRYANT, On the complexity of VLSI implementations and graph representations of Boolean functions with applications to integer multiplication, IEEE Trans. Comput., 40 (1991), pp. 205-213.
9. [Br92] R. BRYANT, Symbolic boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys, 24 (1992), pp. 293-318.
10. [BRS93] A. BORODIN, A. RAZBOROV, AND R. SMOLENSKY, On lower bounds for read-k-times branching programs, Comput. Complexity, 3 (1993), pp. 1-18.
11. [BSSW93] B. BOLLIG, M. SAUERHOFF, D. SIBLING, AND I. WEGENER, Read-k-times Ordered Binary Decision Diagrams-Efficient Algorithms in the Presence of Null Chains, Tech. report 474, Univ. Dortmund, 1993.
12. [BSSW95] B. BULLIG, M. SAUERHOFF, D. SIELING, AND I. WEGENER, Hierarchy theorems for kOBDDs and kIBDDs, Theoret. Comput. Sci., submitted; also available via http://www.eccc.uni-trier.de/eccc/ as TR94-026 (1994).
13. [BW95] B. BOLLIG AND I. WEGENER, Read-Once Projections and formal Circuit Verification with Binary Decision Diagrams, Electronic Colloquium on Computational Complexity, TR95-042, 1995, http://www.eccc.uni-trier.de/eccc/.
14. [Bu92] S. BUSS, The graph of multiplication is equivalent to counting, Inform. Process. Lett., 41 (1992), pp. 199-201.
15. [CSV84] A. CHANDRA, L. STOCKMEYER, AND U. VISHKIN, Constant depth reducibility, SIAM J. Comput., 13 (1984), pp. 423-439.
16. [Du85] P. E. DUNNE, Lower bounds on the complexity of 1-time only branching programs, Lecture Notes in Comput. Sci. 199, Springer-Verlag, New York, 1985, pp. 90-99.
17. [FHS78] S. FORTUNE, J. HOPCROFT, AND E. M. SCHMIDT, The complexity of equivalence and containment for free single variable program schemes, Lecture Notes in Comput. Sci. 62, Springer-Verlag, New York, 1978, pp. 227-240.
18. [FSS84] M. FURST, J. B. SAXE, AND M. SIPSER, Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory, 17 (1984), pp. 13-27.
19. [Ge94] J. GERGOV, Time-space tradeoffs for integer multiplication on various types of input-oblivious sequential machines, Inform. Process. Lett., 51 (1994), pp. 265-269.
20. [GM94] J. GERGOV AND C. MEINEL, Efficient Boolean manipulations with OBDD's can be extended to FBDD's, IEEE Trans. Comput., 43 (1994), pp. 1197-1209.
21. [Gu77] V. A. GURVICH, On the normal form of positional games, Uspekhi Mat. Nauk, 32 (1977), pp. 183-184 (in Russian).
22. [HMPST93] A. HAJNAL, W. MAASS, P. PUDLÁK, M. SZEGEDY, AND G. TURÁN, Threshold circuits of bounded depth, J. Comput. System Sci., 46 (1993), pp. 129-154.
23. [JABFA92] J. JAIN, M. ABADIR, J. BITNER, D. FUSSELL, AND J. ABRAHAM, IBDD's: An efficient functional representation for digital circuits, in Proceedings of the European Conference on Design Automation, 1992, pp. 440-446.
24. [Ju88] S. JUKNA, Entropy of contact circuits and lower bounds on their complexity, Theoret. Comput. Sci., 47 (1988), pp. 113-129.
25. [Ju89] S. JUKNA, The effect of null-chains on the complexity of contact schemes, in Proc. FCT, Lecture Notes in Comput. Sci. 380, Springer-Verlag, New York, 1989, pp. 246-256.
26. [Ju92] S. JUKNA, A note on read-k-times branching programs, RAIRO Theoret. Inform. Appl., 29 (1995), pp. 75-83.
27. [Ju94] S. JUKNA, The Graph of Multiplication is Hard for Read-k-Times Networks, Tech. report 95-10, University of Trier, Trier, Germany, 1995.
28. [KLNSW93] M. KARCHMER, N. LINIAL, I. NEWMAN, M. SAKS, AND A. WIGDERSON, Combinatorial characterization of read-once formulae, Discrete Math., 114 (1993), pp. 275-282.
29. e, Theoret. Comput. Sci., 86 (1991), pp. 267-275.
30. [Kr88] M. KRAUSE, Exponential lower bounds on the complexity of real time and local branching programs, J. Inform. Processing and Cybernetics (EIK), 24 (1988), pp. 99-110.
31. [Kr91] M. KRAUSE, Lower bounds for depth-restricted branching programs, Inform, and Comput., 91 (1991), pp. 1-14.
32. [Kr94] S. KRISCHER, FANCY, version 1.1, http://www.informatik.uni-trier.de/~krischer/. Universität Trier, Germany, November 1994.
33. [KW91] M. KRAUSE AND S. WAACK, On oblivious branching programs of linear length, Inform. Comput., 94 (1991), pp. 232-249.
34. [Ma76] W. MASEK, A Fast Algorithm for the String-Editing Problem and Decision Graph Complexity, SM Thesis, MIT, Cambridge, MA, 1976.
35. [Me89] C. MEINEL, Modified branching programs and their computational power, Lecture Notes in Comput. Sci. 370, Springer-Verlag, New York, 1989.
36. [Ok91] E. A. OKOLNISHNIKOVA, Lower bounds for branching programs computing characteristic functions of binary codes, Metody Diskret. Anal., 51 (1991), pp. 61-83 (in Russian).
37. [Po95] S. PONZIO, Restricted Branching Programs and Hardware Verification, Ph.D. thesis, MI Technology, Cambridge, MA, August 1995; Tech. report MIT/LCS/TR-663, http://uww.lcs.mit.edu/ and http://uuu.eccc.uni-trier.de/eccc/.
38. [SDG94] A. SHEN, S. DEVADAS, AND A. GHOSH, Probabilistic manipulation of boolean functions using free boolean diagrams, IEEE Trans. Computer-Aided Design, 14 (1995), pp. 87-95.
39. [SS93] 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, J. Cai, ed., DIMACS Series, Vol. 13, AMS, Providence, RI, 1993, pp. 183-193.
40. [SV81] S. SKYUM AND L. G. VALIANT, A complexity theory based on Boolean algebra, J. Assoc. Comput. Mach., 32 (1985), pp. 484-502.
41. [SW95] D. SIELING AND I. WEGENER, Graph driven BDD's - A new data, structure for boolean functions, Theoret. Comput. Sci., 141 (1995), pp. 283-310.
42. [SZ96] P. SAVICKY AND S. ZAK, A large lower bound for 1-branching programs, Electronic Colloquium on Computational Complexity, TR96-036, 1996, http://www.eccc.-uni-trier.de/eccc/.
43. [We87] I. WEGENER, The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science, New York, Stutggart, 1987.
44. [We88] I. WEGENER, On the complexity of branching programs and decision trees for clique functions, J. Assoc. Comput. Mach., 35 (1988), pp. 461-471.
45. [We93] I. WEGENER, Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions, Inform. Process. Lett., 46 (1993), pp. 85-87.
46. [We94] I. WEGENER, Efficient data structures for boolean functions, Discrete Math., 136 (1994), pp. 347-372.
47. [Za84] S. ZAK, An exponential lower bound for one-time-only branching programs, in Proc. 11th MFCT, Lecture Notes in Comput. Sci. 176, Springer-Verlag, New York, 1984, pp. 562-566.