Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.



Re: What is this problem called?
Posted:
Jul 5, 2005 4:56 AM


"Russell Easterly" <logiclab@comcast.net> writes:
> I have a proof that X3SAT can be converted to subset sum. > According to Wikipedia, subset sum is NPComplete.
Note that this isn't a proof that X3SAT is NPcomplete  it just proves that it is in NP. To prove it is NPcomplete, you also need to show that subsetsum can be reduced to X3SAT.
Torben



