np-complete


proof NP-complete


Hi guys I have a question. I am wondering if anyone know how to proof it.
Here is the question:
The Subset Sum problem is shown to be NP-complete. The input is a sequence of positive numbers w1, ... ,wn, W, where W is the target weight. The problem is to decide whether there is a set of weights F ⊆ {1, ... ,n} such that the the sum of some weights equal to the target weight (i.e. w1 + ... + wi = W)
Let the Restricted Subset Sum problem be defined like Subset Sum, but with the extra requirement that the target weight is less than half the sum of all weights. (If this fails then the input must be rejected right away.) Show that Restricted Subset Sum is NP-complete.
Thank you.
You have to show (a) your problem is in NP and (b) your problem is NP hard. For (a), show that a solution to some problem in NP would make solving your problem easy (if you think about it, showing this is trivial). For (b), you need to show that a solution to your problem would make solving any problem in NP easy (in other words, find another NP-complete problem whose solution can be rephrased in terms of a solution to your problem).
This is already practically half the proof - (a) is trivial now - I'd prefer not to do the rest.

Related Links

Given a graph with n vertices and m edges, does it contain a simple cycle of length ⌈n/2⌉?
NP-complete or NP-hard?
Why using linear integer programming (ILP) though it is NP-Complete?
Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?
Reduction to Clique prob
Approximation Algorithm between two NP compete problems
Is it possible to find the probability to a solution of NP-complete problems?
Knapsack for each weight having multiple values - Is it possible to solve?
Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete
How I can prove that 2-CNF is not NP-complete?
When NP complete becomes NP hard
Can it be proven no polynomial algorithm exists for an NP-Complete prob.?
Effect of number base when proving NP completeness of numerical problems
How to reduce 3COLOR to 3SAT?
proof NP-complete
Proof that Dominating Set is NP-Complete

Categories

HOME
pandas
testng
coq
deezer
fluentd
heroku
at-command
setup-deployment
electronics
windows-server
fingerprint
webrequest
adfs
rascal
collectd
google-apps-marketplace
messages
ups
decomposition
jtextfield
conemu
cloudhub
telerik-reporting
crosstab
fish
brunch
maquette
typo3-6.2.x
jspm
procdump
skia
r-raster
yadcf
scorm2004
restlet
qwerty
gesture
splice
quadratic-programming
eclipse-gef
dds
dandelion
ionicons
magma
sybase-asa
bind9
dwscript
webdriverjs
vtigercrm
crosswalk-runtime
eventkit
root-framework
dstu2-fhir
multiple-regression
nsviewcontroller
livequery
php-internals
photobucket
browser-link
historian
javax.sound.midi
kendonumerictextbox
intel-fortran
spidermonkey
sframe
jsapi
rake-task
oxwall
ng-animate
nstableviewcell
cctv
websocket4net
google-reader
valueconverter
comexception
mysql-error-1062
undefined-reference
transcoding
openlaszlo
mcts
tinn-r
angularjs-controller
libstdc++
gnu-prolog
external-accessory
winbugs14
fluent-interface
gin
firefox4
adrotator

Resources

Encrypt Message