Theoretical study on mixed parallel execution for solving SAT

.For the satisfiability problem (SAT), we have proposed a neural network, called LPPH, and a parallelization method, called “mixed parallel execution,” in which LPPH and other algorithms are executed simultaneously. In this paper we study the CPU time of the mixed parallel execution, and prove that the bigger the difference between distribution functions of CPU time of the algorithms used in the parallel execution, the more effective the mixed parallel execution is.