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

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

2010-06-29

arxiv.org/abs/1006.5621v1

Computer Science

Discrete Mathematics

Scientific paper

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, and Ravve] -- 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.

Affiliated with

Also associated with

No associations

Rating

Better algorithms for satisfiability problems for formulas of bounded rank-width does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Better algorithms for satisfiability problems for formulas of bounded rank-width, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Better algorithms for satisfiability problems for formulas of bounded rank-width will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314744