Research on satisfiability threshold of class of Boolean equations
一类布尔方程组的可满足性阈值研究*

This paper focused on the satisfiability threshold of the NP problem which consisted of a class of Boolean equations.By the method of mixing Gauss-elimination algorithm and leaf-removal algorithm,proposed a new effective complete algorithm to achieve the solutions.Obtained the estimation of the satisfiability threshold of the original problem by numerical experiments on large scale of instances with different parameter values.The results not only approximate the satisfiability threshold firstly,but also provide the basis to design heuristics algorithms for NP problems with the form of Boolean equations.