%0 Journal Article %1 journals/algorithmica/PaulusmaSS16 %A Paulusma, Daniël %A Slivovsky, Friedrich %A Szeider, Stefan %D 2016 %J Algorithmica %K dblp %N 1 %P 168-194 %T Model Counting for CNF Formulas of Bounded Modular Treewidth. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica76.html#PaulusmaSS16 %V 76

@article{journals/algorithmica/PaulusmaSS16, added-at = {2023-11-12T00:00:00.000+0100}, author = {Paulusma, Daniël and Slivovsky, Friedrich and Szeider, Stefan}, biburl = {https://www.bibsonomy.org/bibtex/2c03bb8ee14b644b7d4e30e7062312c00/dblp}, ee = {https://doi.org/10.1007/s00453-015-0030-x}, interhash = {15425bfa1a6fd541e7982506dbcbd8ee}, intrahash = {c03bb8ee14b644b7d4e30e7062312c00}, journal = {Algorithmica}, keywords = {dblp}, number = 1, pages = {168-194}, timestamp = {2024-04-08T18:21:21.000+0200}, title = {Model Counting for CNF Formulas of Bounded Modular Treewidth.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica76.html#PaulusmaSS16}, volume = 76, year = 2016 }