On the existence of polynomial time approximation schemes for OBDD minimization (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 205-215

  Sieling, Detlef ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXTENDED ABSTRACTS; LOWER BOUNDS; NP COMPLETE; ORDERED BINARY DECISION DIAGRAMS; PERFORMANCE RATIO; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; VARIABLE ORDERING;

APPROXIMATION ALGORITHMS; BINARY DECISION DIAGRAMS; COMPUTER SCIENCE;

POLYNOMIAL APPROXIMATION;

EID: 78649808604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028562     Document Type: Conference Paper

References (20)

1. 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.
2. Bollig, B. and Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers 45, 993-1002, 1996.
3. Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24, 293-318, 1992.
4. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35, 677-691, 1986.
5. Friedman, S.J. and Supowit, K.J.: Finding the optimal variable ordering for binary decision diagrams. IEEE Transactions on Computers 39, 710-713, 1990.
6. 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.
7. Garey, M.R. and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
8. Håstad, J.: Some optimal inapproximability results. In Proc. of 29th Symposium on Theory of Computing STOC, 1-10, 1997.
9. 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. (Pubitemid 23562864)
10. 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.
11. 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.
12. 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.
13. Motwani, R. and Raghavan, P.: Randomized Algorithms. Cambridge University Press, 1995.
14. Papadimitriou, C.H. and Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425-440, 1991.
15. Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In Proc. of International Conference on Computer-Aided Design ICCAD, 42-47, 1993.
16. Savický, P. and Wegener, I.: Efficient algorithms for the transformation between different types of binary decision diagrams. Acta Informatica 34, 245-256, 1997. (Pubitemid 127361955)
17. 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.
18. Sieling, D. and Wegener, I.: NC-algoritbms for operations on binary decision diagrams. Parallel Processing Letters 3, 3-12, 1993.
19. 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.
20. Wegener, I.: Efficient data structures for Boolean functions. Discrete Mathematics 136, 347-372, 1994.