Author:
Behrens Jan,Waack Stephan
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. J. Bern, C. Meinel, and A. Slobodová. Global rebuilding of obdds avoiding memory requirement maxima, IEEE Trans. on Computers 1996, 15, 131–134.
2. R. E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers 1986, 35, pp. 677–691.
3. R. E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comp. on Surveys 1992, 24, pp. 293–318.
4. B. Bollig, I. Wegener, Improving the variable ordering of OBDDs is NP-complete., Forschungsbericht Nr. 542 (1994) des Fachbereichs Informatik der Universität Dortmund.
5. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Computation 1990, 9, pp. 251–280.