Re: np-complete


CubanBoy wrote:
Hay, im cuban, im trying to demostrate that the minimun sum of squares
is an np-complete problem, sorry for my bad english, if you have any
suggest or any clue, please conctact me at
nelly"at"infomed.sld.cu
change in the email adress "at" by @

You need to state precisely what your problem is.

First of all, minimization and maximization problems are not
NP-complete; NP-complete problems either return YES or NO.

You might be talking about the "threshold" version of a minimization
problem, such as:

INPUT: A sequence of numbers a(1), a(2), ..., a(n), and an integer k.
OUTPUT: Is there a nonzero subset S such that the sum of (a(i))^2, for
all i in S, is less than k?

--- Christopher Heckman

.