A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth (bibtex)
by ,
Reference:
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence TreewidthFriedrich Slivovsky, Stefan SzeiderProceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 267–276, 2020, Springer Verlag.
Bibtex Entry:
@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@InProceedings{SlivovskySzeider20,
author    = {Friedrich Slivovsky and Stefan Szeider},
title     = {A Faster Algorithm for Propositional Model Counting
Parameterized by Incidence Treewidth},
booktitle = {Proceedings of SAT 2020, The 23rd International
Conference on Theory and Applications of
Satisfiability Testing},
year      = {2020},
pages     = {267--276},
editor    = {Luca Pulina and Martina Seidl},
series    = LNCS,
publisher = Springer,
pdf      = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-20-006.pdf},
volume    = {12178},
keywords   ={slim,reveal,l2solve},
}