Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider the following PARTITION search problem. input. A set of integers S = {xi, X2, , Xal_ each integer can be positive, negative, or zero.
Consider the following "PARTITION" search problem. input. A set of integers S = {xi, X2, , Xal_ each integer can be positive, negative, or zero. Output: A partition of S into subsets S1,S2 with equal sum, if such a partition is possible; otherwise return the special value NIL. (S1.S2 is a "partition" of S if every element of S belongs to one of S1 or S2, but not to both.) (a) [5 marks] Give a precise definition for a decision problem "PART" related to the PARTITION search problem. (b) [15 marks] Give a detailed argument to show that the PARTITION search problem is polynomial- time self-reducible. (WARNING: Remember that the input to the decision problem does not contain any information about the partition-if it even exists.)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started