Recognition of zero bits of 3-sat problem by applying linear algebra’s methods
Yuri Ogorodnikov, Y. Faizullin · Computer Optics · 2014
The paper presents two heuristic methods of recognizing zero bits satisfiability problem. The first is based on the reduction of the satisfiability problem to an equivalent problem of minimizing a continuous smooth function by method of successive approximations, extended by changing the order of calculation of variables. Another way is to reduce to a system of linear algebraic equations with symmetric diagonally dominant matrix.