A filled function method for satisfiability problem
Geng Lin · Journal of Minjiang University · 2011
Satisfiability problem is firstly proved to be an NP-complete problem.Firstly,this paper defines a concept of the distance between two solutions.Next,a filled function with only one parameter is constructed,it is simple and easy to calculate.Then a filled function method for satisfiability problem is proposed,numerical results show that the proposed algorithm is efficient.