Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions
IEEE Transactions on Computers
A direct construction of polynomial-size OBDD proof of pigeon hole problem
Information Processing Letters
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |