Skip to main content
SpringerLink
Log in

Optimizing OBDDs is still intractable for monotone functions

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1998 (MFCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1450))

Abstract

Optimizing the size of Ordered Binary Decision Diagrams is shown to be NP-complete for monotone Boolean functions. The same result for general Boolean functions was obtained by Bollig and Wegener recently.

Supported in part by Scientific Research Grant, Ministry of Education, Japan

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.Alon and R.B.Boppana: The monotone circuit complexity of Boolean functions, Combinatorica 7(1)a, pp.1–22 (1987).

    MATH  MathSciNet  Google Scholar 

  2. B.Bollig and I.Wegener: Improving the variable ordering of OBDDs Is NP-complete, IEEE Trans. Comput. Vol.45,No.9,pp.993–1002(1996).

    Article  MATH  Google Scholar 

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

    Google Scholar 

  4. M.R.Garey, D.S.Johnson and L.Stockmeyer: Some simplified NP-complete graph problems, Theoretical Computer Science, Vol.1, pp.237–267(1976).

    Article  MATH  MathSciNet  Google Scholar 

  5. K.Hosaka, Y.Takenaga, T. Kaneda and S. Yajima: Size of ordered binary decision diagrams representing threshold functions, Theoret. Comput. Sci.180,pp.47–60 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  6. S.Jukuna, A.Razborov, P.Savicky and I.Wegener: On P versus NP∩co-NP for decision trees and read-once branching problems, Proc.27nd MFCS, pp.319–326 (1997).

    Google Scholar 

  7. M.R.Mercer, R.Kapur and D.E.Ross: Functional approached to generating orderings for efficient symbolic representation, Proc. 29th ACM/IEEE Design Automation Conference, pp.614–619 (1992).

    Google Scholar 

  8. S.Muroga: Threshold logic and its applications, John Wiley & Sons (1971).

    Google Scholar 

  9. C.E.Shannon: The synthesis of two-terminal switching circuits, Bell Systems Tech.J. 28(1),pp.59–98(1949).

    MathSciNet  Google Scholar 

  10. S. Tani, K. Hamaguchi and S. Yajima: The complexity of the optimal variable ordering problems of a shared binary decision diagram, IEICE Trans.Inf.& Syst., Vol.E79-D,No.4,pp.271–281(1996).Also, in Proc.ISAAC93.

    Google Scholar 

  11. E. Tardos: The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica, Vol.8,No.1,pp.141–142(1988).

    Article  MATH  MathSciNet  Google Scholar 

  12. U.Zwick: A 4n lower bound on the combinational complexity of certain symmetric Boolean functions over the basis of unate dyadic Boolean functions, SIAM J. COMPUT., Vol.20,No.3,pp.499–505(1991).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kyoto University, 606, Kyoto, Japan

    Kazuo Iwama & Mitsushi Nozoe

  2. Kansai University, Takatsuki, 569, Osaka, Japan

    Shuzo Yajima

Authors
  1. Kazuo Iwama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mitsushi Nozoe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuzo Yajima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwama, K., Nozoe, M., Yajima, S. (1998). Optimizing OBDDs is still intractable for monotone functions. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055813

Download citation

  • DOI: https://doi.org/10.1007/BFb0055813

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

  • Online ISBN: 978-3-540-68532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation