The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions

  • Ingo Wegener
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)


Boolean functions are often represented by ordered binary decision diagrams (OBDDs) introduced by Bryant [2]. Liaw and Lin [7] have proved upper and lower bounds on the minimal OBDD size of almost all Boolean functions. Now tight bounds are proved for the minimal OBDD size for arbitrary or optimal variable orderings and for the minimal read-once branching program size of almost all functions. Almost all Boolean functions have a sensitivity of almost 1, i. e. the minimal OBDD size for an optimal variable ordering differs from the minimal OBDD size for a worst variable ordering by a factor of at most 1 + ɛ(n) where ɛ(n) converges exponentially fast to 0.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K.S. Brace, R.L. Rudell and R.E. Bryant. Efficient implementation of a BDD package. In 27th ACM/IEEE Design Automation Conference, 1990, pp. 40–45.Google Scholar
  2. 2.
    R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 35(8), 1986, pp. 677–691.Google Scholar
  3. 3.
    R.E. Bryant. On the complexity of VLSI implementations and graph representations with application to integer multiplication. IEEE Trans. on Computers 40(2), 1991, pp. 205–213.Google Scholar
  4. 4.
    P. Erdös and J. Spencer. Probabilistic methods in combinatorics. New York, Academic Press, 1974.Google Scholar
  5. 5.
    W. Feller. An introduction to probability theory and its applications. New York, Wiley, 1968.Google Scholar
  6. 6.
    V.F. Kolchin, B.A. Sevast'yanov and V.P. Christyakov. Random allocations. New York, Wiley, 1978.Google Scholar
  7. 7.
    H.-T. Liaw and C.-S. Lin. On the OBDD-representation of general Boolean functions. IEEE Trans. on Computers 41(6), 1992, pp. 661–664.Google Scholar
  8. 8.
    C.E. Shannon. The synthesis of two-terminal switching circuits. AT&T Bell Syst. Tech. J. 28, 1949, pp. 59–98.Google Scholar
  9. 9.
    D. Sieling and I. Wegener. Graph driven BDD's — a new data structure for Boolean functions. Submitted to Theoretical Computer Science.Google Scholar
  10. 10.
    I. Wegener. The complexity of Boolean functions. New York, Wiley, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Ingo Wegener
    • 1
  1. 1.FB Informatik, LS IIUniv. DortmundDortmundFed. Rep. of Germany

Personalised recommendations