1. [Amano 07] Amano, K. and Maruoka, A.: Better upper bounds on the QOBDD size of integer multiplication, Discrete Applied Mathematics, Vol. 155.10, pp. 1224–1232 (2007)
2. [Bollig 91] Bollig, B., Lobbing, M., Sauerhoff, M., and Wegener, I.: On the complexity of the hidden weighted bit function for various BDD models, Theoretical Informatics and Applications, Vol. 33, No.2, pp. 103–115 (1991)
3. [Bova 16] Bova, S.: SDDs are exponentially more succinct than OBDDs, Proceedings of the 30th Conference on Artificial Intelligence (AAAI 2016), pp. 929–935 (2016)
4. [Broeck 15] Broeck, G. V. D. and Darwiche, A.: On the role of canonicity in knowledge compilation, Proceedings of the 29th Conferenceon Artificial Intelligence (AAAI 2015), pp. 1641–1648 (2015)
5. [Bryant 86] Bryant, R. E.: Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers., Vol. 100.8, pp.677–691 (1986)