Better algorithms for satisfiability problems for formulas of bounded rank-width

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00066369" target="_blank" >RIV/00216224:14330/13:00066369 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.3233/FI-2013-800" target="_blank" >http://dx.doi.org/10.3233/FI-2013-800</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FI-2013-800" target="_blank" >10.3233/FI-2013-800</a>

Result language
angličtina
Original language name
Better algorithms for satisfiability problems for formulas of bounded rank-width
Original language description
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known -- e.g.~[Fischer, Makowsky, andRavve] -- with a single-exponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (since clique-width reaches up to exponentially higher values than rank-width), and can be of practical interest for small values of rank-width. We also provide an algorithm for the MAX-SAT problem along the same lines.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F11%2F0196" target="_blank" >GAP202/11/0196: Well-structured combinatorial classes, width parameters, and design of efficient algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)