A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth

Details A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth

2006-10-31

arxiv.org/abs/cs/0610174v2

Computer Science

Data Structures and Algorithms

9 pages, 1 figure

Scientific paper

We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the bipartite graph whose vertices are the variables and clauses of the given CNF formula; a variable and a clause are joined by an edge if and only if the variable occurs in the clause. Our algorithm runs in time O(4^k k l N), where k denotes the incidence treewidth, l denotes the size of a largest clause, and N denotes the number of nodes of the tree-decomposition.

Affiliated with

Also associated with

No associations

Rating

A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth 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 A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47040