This paper is introduced improvement the algorithm ALG_DIV and QF that decompose and factor the Boolean functions. In this paper, the “divide and conquer” strategy is used to reduce the computing complexity and to improve the computing efficiency of the process to decompose and factor the Boolean functions. The improved algorithm can get a near optimal multilevel logic forms of the Boolean functions.