1. Beame, P., Li, J., Roy, S., Suciu, D.: Lower bounds for exact model counting and applications in probabilistic databases. In: Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, UAI, pp 157–162 (2013)
2. Beame, P., Liew, V.: New limits for knowledge compilation and applications to exact model counting. In: Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI, pp 131–140 (2015)
3. Bollig, B., Buttkus, M.: On the relative succinctness of sentential decision diagrams. Theory Comput. Syst. 63(6), 1250–1277 (2019)
4. Bollig, B., Löbbing, M., Sauerhoff, M., Wegener, I.: On the complexity of the hidden weighted bit function for various BDD models. Theor. Inform. Appl. 33(2), 103–115 (1999)
5. Bova, S.: SDDs are exponentially more succinct than OBDDs. In: Proceedings of the Thirtieth Conference on Artificial Intelligence, AAAI, pp 929–935 (2016)