Computer Science ›› 2012, Vol. 39 ›› Issue (11): 179-182.
Previous Articles Next Articles
Online:
Published:
Abstract: According to the MSP problem (defined in the body) raised in paper[1]，this paper started from the SAT problem to the MSP problem. Thus we provided another proof to the NP-completeness of the MSP problem.
Key words: MSP problem, SAT problem, Polynomially reduction, NP-completeness
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2012/V39/I11/179
Cited
Home