Proving NP-completeness of Polynomial Reduction from the SAT Problem to the MSP Problem
Xinwen Jiang · 2012
According to the MSP problem(defined in the body) raised in paper[1],this paper started from the SAT problem and gave the polynomial reduction algorithm from the SAT problem to the MSP problem.Thus we provided another proof to the NP-completeness of the MSP problem.