Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference18 articles.
1. Improving the variable ordering of OBDDs is NP-complete;Bollig;IEEE Trans. Comput.,1996
2. B. Bollig, I. Wegener, Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems, in: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP), 2000, pp. 187–198.
3. On the size of binary decision diagrams representing boolean functions;Breitbart;Theoret. Comput. Sci.,1995
4. Graph-based algorithms for boolean function manipulation;Bryant;IEEE Trans. Comput.,1986
5. On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication;Bryant;IEEE Trans. Comput.,1991
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献