Učitavanje...
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
The propositional model counting problem (#SAT) is known to be fixed-parameter-tractable (FPT) when parameterized by the width k of a given tree decomposition of the incidence graph. The running time of the fastest known FPT algorithm contains the exponential factor of [Formula: see text]. We improv...
Spremljeno u:
| Izdano u: | Theory and Applications of Satisfiability Testing – SAT 2020 |
|---|---|
| Glavni autori: | , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
2020
|
| Teme: | |
| Online pristup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7326555/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51825-7_19 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|