Author:
Bollig Beate,Wegener Ingo
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Ajtai, M. (1999). A non-linear time lower bound for Boolean branching programs. 40. FOCS, 60–70.
2. Bollig, B. and Wegener, I. (1996). Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Computers 45(9), 993–1002.
3. Bollig, B. and Wegener, I. (1999). Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems. Electronic Colloquium on Computational Complexity (ECCC), Report # TR99-048.
4. Bryant, R. E. (1986). Graph-based algorithms for Boolean manipulation IEEE Trans. on Computers 35, 677–691.
5. Hromkovič, J. (1997). Communication Complexity and Parallel Computing. Springer.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献