Answered step by step
Verified Expert Solution
Question
1 Approved Answer
( 1 5 % ) The NP - complete SUBSET - SUM problem asks, given a set of non - negative integers S and a
The NPcomplete SUBSETSUM problem asks, given a set of nonnegative integers and
a target whether whether or not a subset from a list of integers can sum to a target value. For
example, consider the list of If the target then there are two subsets that
achieve this sum and If then there are no solutions. The AVERAGESUM
problem asks, given just a set of nonnegative integers whether or not a subset from a list of
integers can sum to the average of iei where is the number of elements in It
is similar to the SUBSETSUM problem, except now the target value is always the average value
in S Prove that AVERAGESUM is NPcomplete, or give a polynomialtime algorithm for it
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