A faster algorithm for propositional model counting parameterized by incidence treewidth (Q2661353)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster algorithm for propositional model counting parameterized by incidence treewidth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for propositional model counting parameterized by incidence treewidth |
scientific article |
Statements
A faster algorithm for propositional model counting parameterized by incidence treewidth (English)
0 references
7 April 2021
0 references