Re^9: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))

Plonk

I knew it; you're a plonker.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^9: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))

Replies are listed 'Best First'.
Re^10: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable)) by LanX (Saint) on May 04, 2013 at 00:47 UTC
Enjoy your million! =) Cheers Rolf ( addicted to the Perl Programming Language)	[reply]
Re^11: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable)) by BrowserUk (Patriarch) on May 04, 2013 at 05:13 UTC
Enjoy your last word.	[reply]