Skip to main content
SpringerLink
Log in

Exact OBDD Bounds for Some Fundamental Functions

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Ordered binary decision diagrams (OBDDs) are nowadays one of the most common dynamic data structures or representation types for Boolean functions. Among the many areas of application are verification, model checking, computer aided design, relational algebra, and symbolic graph algorithms. Although many exponential lower bounds on the OBDD size of Boolean functions are known, there are only few functions where the OBDD size is asymptotically known exactly. In this paper the exact OBDD sizes of the fundamental functions multiplexer and addition of n-bit numbers are determined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bollig, B.: The optimal read-once branching program complexity for the direct storage access function. Inf. Process. Lett. 106, 171–174 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bollig, B., Wegener, I.: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems. J. Comput. Syst. Sci. 61, 558–579 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35, 677–691 (1986)

    Article  MATH  Google Scholar 

  4. Hromkovič, J.: Communication Complexity and Parallel Computing. Springer, Berlin (1997)

    MATH  Google Scholar 

  5. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  6. Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Process. Lett. 48, 139–144 (1993)

    MATH  MathSciNet  Google Scholar 

  7. Wegener, I.: The Complexity of Boolean Functions. Wiley, New York (1987)

    MATH  Google Scholar 

  8. Wegener, I.: Branching Programs and Binary Decision Diagrams—Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LS2 Informatik, TU Dortmund, 44221, Dortmund, Germany

    Beate Bollig & Niko Range

Authors
  1. Beate Bollig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Niko Range
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ingo Wegener
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Beate Bollig.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bollig, B., Range, N. & Wegener, I. Exact OBDD Bounds for Some Fundamental Functions. Theory Comput Syst 47, 593–609 (2010). https://doi.org/10.1007/s00224-009-9217-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-009-9217-3

Keywords

Search

Navigation