Comments for blog.gnarlyware.com
https://blog.gnarlyware.com
CS, AI and Random Acts of HackingTue, 19 Mar 2019 15:28:19 +0000
hourly
1 https://wordpress.org/?v=5.6.2
Comment on How to show a problem is NP-complete by Proving the set-covering problem is NP-complete (using reduction from the vertex-cover problem) | blog.gnarlyware.com
https://blog.gnarlyware.com/2019/03/18/how-to-show-a-problem-is-np-complete/#comment-4
Tue, 19 Mar 2019 15:28:19 +0000https://blog.gnarlyware.com/?p=12#comment-4[…] In this post, we will prove that the decision version of the set-covering problem is NP-complete, using a reduction from the vertex covering problem (which is NP-complete). This is Exercise 35.3-2 in CLRS3[1]. We will follow the template given in an earlier post. […]
]]>
Comment on How to show a problem is NP-complete by Proving set-partition problem is NP complete (using reduction from subset sum) | blog.gnarlyware.com
https://blog.gnarlyware.com/2019/03/18/how-to-show-a-problem-is-np-complete/#comment-3
Mon, 18 Mar 2019 22:35:57 +0000https://blog.gnarlyware.com/?p=12#comment-3[…] In this post, we will prove that the set-partition problem is NP-complete using a reduction from the subset sum problem (which is NP-complete[1]). This is Exercise 34.5-5 in CLRS3[1]. We will follow the template given in an earlier post. […]
]]>
Comment on How to show a problem is NP-complete by Proving 0-1 integer programming is NP-complete (using reduction from 3-CNF-SAT) – blog.gnarlyware.com
https://blog.gnarlyware.com/2019/03/18/how-to-show-a-problem-is-np-complete/#comment-2
Mon, 18 Mar 2019 08:35:08 +0000https://blog.gnarlyware.com/?p=12#comment-2[…] In this post, we will prove that 0-1 integer programming is NP-complete using a reduction from 3-CNF-SAT (which is NP-complete[1]). We will follow the template given in an earlier post. […]
]]>