Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1, 241–258 (1997)
2. Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of 30th ACM/IEEE Design Automation Conference (DAC 1993), pp. 272–277 (June 1993)
3. Yoshinaka, R., Kawahara, J., Denzumi, S., Arimura, H., Minato, S.: Counterexample to the long-standing conjecture on the complexity of BDD binary operations. Information Processing Letters 112, 636–640 (2012)
4. Coudert, O.: Solving graph optimization problems with ZBDDs. In: Proceedings of the 1997 European Conference on Design and Test (EDTC 1997), pp. 224–228 (March 1997)
5. Lecture Notes in Computer Science;M. Kiyomi,2012
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献