This paper analyzes the problems of the Quine-McCluskey (QM) method, which solves the redundancy problem of predictive equivalence decision trees (DTs) by finding the minimal DNF (separate normal form) representation of the DTs. We propose a novel algorithm to improve this problem. Specifically, we highlight the QM method's worst-case running time and space complexity, as well as its inaccuracy in determining predictive equivalence. We then propose an alternative algorithm that can solve the problem in polynomial time for the DT size.