Skip to main content
Springer Nature Link
Log in

Minimization Problems for Parity OBDDs

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

Abstract

Parity Ordered Binary Decision Diagrams (⊕OBDDs) are a data structure for boolean functions that extends the well-known OBDDs and reduces the representation size for several functions. Both data structures share the problem that the representation size strongly depends on the chosen variable order. For ⊕OBDDs the number of edges and thus the representation size is also influenced by the choice of the basis of the represented vector space. In this paper the hardness of some minimization problems for ⊕OBDDs is proven, namely, that there is no polynomial time approximation scheme for minimizing the number of nodes by choosing the variable order and for minimizing the number of edges, where the variable order may be changed or is fixed, unless P=NP.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45, 993–1002 (1996)

    Article  MATH  Google Scholar 

  2. Bollig, B., Löbbing, M., Sauerhoff, M., Wegener, I.: Complexity theoretical aspects of OFDDs. In: Sasao, T., Fujita, M. (eds.) Representations of Discrete Functions, pp. 249–268. Kluwer Academic, Dordrecht (1996)

    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. Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634–652 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Feldheim, H., Homeister, M., Waack, S.: Algorithmical and structural properties of parity OBDDs. RAIRO Theor. Inf. Appl. (2006, to appear)

  6. Gergov, J., Meinel, C.: Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs. In: Proc. of 10th Symposium on Theoretical Aspects of Computer Science, pp. 576–585 (1993)

  7. Gergov, J., Meinel, C.: Efficient Boolean manipulation with OBDD’s can be extended to FBDD’s. IEEE Trans. Comput. 43, 1197–1209 (1994)

    Article  MATH  Google Scholar 

  8. Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kebschull, U., Schubert, E., Rosenstiel, W.: Multilevel logic synthesis based on functional decision diagrams. In: Proc. of European Design Automation Conference, pp. 43–47 (1992)

  10. Král, D.: Algebraic and uniqueness properties of parity ordered binary decision diagrams and their generalization. In: Proc. of Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 1893, pp. 477–487

  11. Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. of International Conference on Computer-Aided Design, pp. 42–47 (1993)

  12. Sieling, D.: The complexity of minimizing and learning OBDDs and FBDDs. Discrete Appl. Math. 122, 263–282 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sieling, D.: The nonapproximability of OBDD minimization. Inf. Comput. 172, 103–138 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sieling, D., Wegener, I.: Reduction of OBDDs in linear time. Inf. Process. Lett. 48, 139–144 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sieling, D., Wegener, I.: Graph driven BDDs—a new data structure for Boolean functions. Theor. Comput. Sci. 141, 283–310 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Tani, S., Hamaguchi, K., Yajima, S.: (1993). The complexity of the optimal variable ordering problems of shared binary decision diagrams. In: Proc. of 4th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 762, pp. 389–398. Springer, New York (1993)

    Google Scholar 

  17. Waack, S.: On the descriptive and algorithmic power of parity ordered binary decision diagrams. Inf. Comput. 166, 61–70 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, Universität Dortmund, 44221, Dortmund, Germany

    Detlef Sieling

Authors
  1. Detlef Sieling
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Detlef Sieling.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sieling, D. Minimization Problems for Parity OBDDs. Theory Comput Syst 44, 391–413 (2009). https://doi.org/10.1007/s00224-007-9084-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9084-8

Keywords