Sciweavers

Share
JSAT
2006

A Note on the Use of Independent Sets for the k-SAT Problem

9 years 10 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due to a simple observation we prove that a k-SAT instance over n variables with independent set of size i can be solved in time O(2(k-1)(n - i)) where k(n) denotes an upper bound on the complexity of solving k-SAT over n variables.
Konstantin Kutzkov
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JSAT
Authors Konstantin Kutzkov
Comments (0)
books