NP reduction from subset sum to Knapsack

NP reduction from subset-sum to Knapsack
We prove that one can do NP reduction from subset-sum to Knapsack

So we prove that Knapsack is np-complete by assuming subset-sum is np-complete

Donate to Channel(斗內一下): https://paypal.me/kuoenjui
Facebook: https://www.facebook.com/mathenjui
Instagram: https://www.instagram.com/mathphyen/

Theoretical Computer science (TCS): https://www.youtube.com/playlist?list=PLg9w7tItBlZujE3RVc_7A5MaBMAWzcQjJ