New worst upper bound for #SAT

06/08/2010
by   Junping Zhou, et al.
0

The rigorous theoretical analyses of algorithms for #SAT have been proposed in the literature. As we know, previous algorithms for solving #SAT have been analyzed only regarding the number of variables as the parameter. However, the time complexity for solving #SAT instances depends not only on the number of variables, but also on the number of clauses. Therefore, it is significant to exploit the time complexity from the other point of view, i.e. the number of clauses. In this paper, we present algorithms for solving #2-SAT and #3-SAT with rigorous complexity analyses using the number of clauses as the parameter. By analyzing the algorithms, we obtain the new worst-case upper bounds O(1.1892m) for #2-SAT and O(1.4142m) for #3-SAT, where m is the number of clauses.

READ FULL TEXT
research
02/24/2011

New Worst-Case Upper Bound for X3SAT

The rigorous theoretical analyses of algorithms for exact 3-satisfiabili...
research
02/24/2011

Worst-Case Upper Bound for (1, 2)-QSAT

The rigorous theoretical analysis of the algorithm for a subclass of QSA...
research
02/10/2018

SAT solving techniques: a bibliography

We present a selective bibliography about efficient SAT solving, focused...
research
09/12/2018

Exponential-Time Approximation Algorithms for MAX-SAT: Correlations and Implications

We provide three different algorithms for MAX-SAT approximation. Each of...
research
04/22/2021

A New Approach to CNF-SAT From a Probabilistic Point of View

The following paper proposes a new approach to determine whether a logic...
research
07/10/2019

Approximate Voronoi cells for lattices, revisited

We revisit the approximate Voronoi cells approach for solving the closes...
research
08/08/2018

A Kernel Method for Positive 1-in-3-SAT

This paper illustrates the power of Gaussian Elimination by adapting it ...

Please sign up or login with your details

Forgot password? Click here to reset