
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Beate Bollig, Ingo Wegener, "Improving the Variable Ordering of OBDDs Is NPComplete," IEEE Transactions on Computers, vol. 45, no. 9, pp. 9931002, September, 1996.  
BibTex  x  
@article{ 10.1109/12.537122, author = {Beate Bollig and Ingo Wegener}, title = {Improving the Variable Ordering of OBDDs Is NPComplete}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {9}, issn = {00189340}, year = {1996}, pages = {9931002}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.537122}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improving the Variable Ordering of OBDDs Is NPComplete IS  9 SN  00189340 SP993 EP1002 EPD  9931002 A1  Beate Bollig, A1  Ingo Wegener, PY  1996 KW  Ordered binary decision diagrams KW  NPcompleteness KW  variable orderings KW  verification KW  graph algorithms. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—Ordered binary decision diagrams are a useful representation of Boolean functions, if a good variable ordering is known. Variable orderings are computed by heuristic algorithms and then improved with local search and simulated annealing algorithms. This approach is based on the conjecture that the following problem is NPcomplete. Given an OBDD
[1] B. Bollig, M. Löbbing, and I. Wegener, "Simulated Annealing to Improve Variable Orderings for OBDDs," Proc. Int'l Workshop Logic Synthesis, pp. 5.15.10, 1995.
[2] R.E. Bryant, "GraphBased Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C35, No. 8, Aug. 1986, pp. 667690.
[3] R.E. Bryant, "Symbolic Boolean Manipulation with Ordered BinaryDecision Diagrams," ACM Computing Surveys, vol., 24 no. 3, pp. 293318, 1992.
[4] K.M. Butler, D.E. Ross, R. Kapur, and M.R. Mercer, "Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams," Proc. 28th ACM/IEEE Design Automation Conf., pp. 417420, 1991.
[5] L. Fortune, J. Hopcroft, and E.M. Schmidt, "The Complexity of Equivalence and Containment for Free Single Variable Program Schemes," Goos, Hartmanis, Ausiello, and Bohm, eds., Lecture Notes in Computer Science 62, pp. 227240. SpringerVerlag, 1978.
[6] S.J. Friedman and K.J. Supowit, "Finding the Optimal Variable Ordering for Binary Decision Diagrams," IEEE Trans. Computers, vol. 39, no. 5, pp. 710713, May 1990.
[7] M. Fujita, H. Fujisawa, and N. Kawato, "Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams," Proc. ICCAD, IEEE CS Press, 1988, pp. 25.
[8] M. Fujita, Y. Matsunaga, and T. Kakuda, "On variable Ordering of Binary Decision Diagrams for the Application of MultiLevel Logic Synthesis," Proc. European Design Automation Conf., pp. 5054, 1991.
[9] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[10] N. Ishiura, H. Sawada, and S. Yajima, "Minimization of Binary Decision Diagrams Based on Exchanges of Variables," Proc. IEEE Int'l Conf. Computer Aided Design, pp. 472475, 1991.
[11] S. Malik, A.R. Wang, R.K. Brayton, and A. SangiovanniVincentelli, Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment Proc. IEEE Int'l Conf. ComputerAided Design (ICCAD88), pp. 69, 1988.
[12] M.R. Mercer, R. Kapur, and D.E. Ross, "Functional Approaches to Generating Orderings for Efficient Symbolic Representation," Proc. 29th ACM/IEEE Design Automation Conf, pp. 614619, 1992.
[13] S. Minato, N. Ishiura, and S. Yajima, Shared Binary Decision Diagrams with Attributed Edges for Efficient Boolean Function Manipulation Proc. Design Automation Conf., pp. 5257, 1990.
[14] D.E. Ross, K. M. Butler, R. Kapur, and M.R. Mercer, "Fast Functional Evaluation of Candidate OBDD Variable Ordering," Proc. European Design Automation Conf., pp. 410, 1991.
[15] R. Rudell, "Dynamic Variable Ordering for Ordered Binary Decision Diagrams," Proc. ICCAD93, pp. 4247, 1993.
[16] D. Sieling and I. Wegener, "Reduction of OBDDs in Linear Time," Information Processing Letters, vol. 48, pp. 139144, 1993.
[17] D. Sieling and I. Wegener, "NCAlgorithms for Operations on Binary Decision Diagrams," Parallel Processing Letters, vol. 3, no. 1, pp. 312, 1993.
[18] S. Tani, K. Hamaguchi, and S. Yajima, "The Complexity of the Optimal Variable Ordering Problems of a Shared Binary Decision Diagram," Proc. 4th Int'l Symp. Algorithms and Computation, Lecture Notes in Computer Science 762, pp. 389398, 1993.