Abstract
The size of Ordered Binary Decision Diagrams (OBDDs) is determined by the chosen variable ordering. A poor choice may cause an OBDD to be too large to fit into the available memory. The decision variant of the variable ordering problem is known to be NP-complete. We strengthen this result by showing that there is no polynomial time approximation scheme for the variable ordering problem unless P = NP. We also prove a small lower bound on the performance ratio of a polynomial time approximation algorithm under the assumption P ≠ NP.
Supported in part by DFG grant We 1066/8.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bollig, B., Löbbing, M. and Wegener, I.: Simulated annealing to improve variable orderings for OBDDs. In Proc. of International Workshop on Logic Synthesis IWLS, 5.1–5.10, 1995.
Bollig, B. and Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers 45, 993–1002, 1996.
Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24, 293–318, 1992.
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35, 677–691, 1986.
Friedman, S.J. and Supowit, K.J.: Finding the optimal variable ordering for binary decision diagrams. IEEE Transactions on Computers 39, 710–713, 1990.
Fujita, M., Fujisawa, H. and Kawato, N.: Evaluation and improvements of Boolean comparison method based on binary decision diagrams. In Proc. of International Conference on Computer-Aided Design ICCAD, 2–5, 1988.
Garey, M.R. and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
Håstad, J.: Some optimal inapproximability results. In Proc. of 29th Symposium on Theory of Computing STOC, 1–10, 1997.
Ishiura, N., Sawada, H. and Yajima, S.: Minimization of binary decision diagrams based on exchanges of variables. In Proc. of International Conference on Computer-Aided Design ICCAD, 472–475, 1991.
Malik, S., Wang, A.R., Brayton, R.K. and Sangiovanni-Vincentelli, A.: Logic verification using binary decision diagrams in a logic synthesis environment. In Proc. of International Conference on Computer-Aided Design ICCAD, 6–9, 1988.
Meinel, C. and Slobodová, A.: On the complexity of constructing optimal ordered binary decision diagrams. In Proc. of International Symposium on Mathematical Foundations of Computer Science MFCS, 515–524, 1994.
Minato, S., Ishiura, N. and Yajima, S.: Shared binary decision diagram with attributed edges for efficient Boolean function manipulation. In Proc. of 27th Design Automation Conference DAC, 52–57, 1990.
Motwani, R. and Raghavan, P.: Randomized Algorithms. Cambridge University Press, 1995.
Papadimitriou, C.H. and Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440, 1991.
Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In Proc. of International Conference on Computer-Aided Design ICCAD, 42–47, 1993.
Savický, P. and Wegener, I.: Efficient algorithms for the transformation between different types of binary decision diagrams. Acta Informatica 34, 245–256, 1997.
Sieling, D.: Variable orderings and the size of OBDDs for partially symmetric Boolean functions. In Proc. of the Synthesis and System Integration of Mixed Technologies SASIMI, 189–196, 1996. Submitted to Random Structures & Algorithms.
Sieling, D. and Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters 3, 3–12, 1993.
Tani, S., Hamaguchi, K. and Yajima, S.: The complexity of the optimal variable ordering problems of shared binary decision diagrams. In Proc. of 4th International Symposium on Algorithms and Computation ISAAC, 389–398, 1993.
Wegener, I.: Efficient data structures for Boolean functions. Discrete Mathematics 136, 347–372, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Sieling, D. (1998). On the existence of polynomial time approximation schemes for OBDD minimization. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028562
Download citation
DOI: https://doi.org/10.1007/BFb0028562
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive