Home > Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings > A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings |
Springer International Publishing
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Chapter Info
Authors
ARI Id
1665262303514_5613634
Access
Not Available Free
Pages
267-276
DOI
Chapter URL
https://rd.springer.com/chapter/10.1007/978-3-030-51825-7_19
Table of Contents of Book
Chapters/Headings | Author(s) | Pages | Info |
Loading... | |||
Chapters/Headings | Author(s) | Pages | Info |
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...
Similar News
Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...