Report - NP-Complete Problemscpennycu/2018/assets/fa-ToC-21.pdf · To show that all NP-Complete problems are polynomial-time reducible to it. IDEA: Reduce 3SAT φ to VERTEX-COVER. In effect,

Please pass captcha verification before submit form