• • • 11.32. *The sum-of-subsets problem is the following: Given a sequence ai, a2, an of integers, and an integer M, is
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
• • • 11.32. *The sum-of-subsets problem is the following: Given a sequence ai, a2, an of integers, and an integer M, is
• • • 11.32. *The sum-of-subsets problem is the following: Given a sequence ai, a2, an of integers, and an integer M, is there a subset J of {1, 2, ..., n} such that Liej d; = = M? Show that this problem is NP-complete by constructing a reduction from the exact cover problem.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!