in reply to Re^6: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))
in thread Divide an array into 2 subsets to verify their sum is equal or not.
too long didn't read all
Shame you have such a limited attention span. Otherwise you might have bothered to read the whole of the sentences you quoted.
I draw your attention to: finding solutions to particular, restricted or bounded examples of particular NP problems
Well, bad trained personnel!
You'd know. YOU are one of them.
Especially if they calculate an approximate solution.
Again, if you could've maintained your attention span for the whole 45-50 seconds it would've taken you to read the entire post, you'd realise that all you doing it repeating what *I said* in my post.
Please don't respond further as I can't be bothered with having to repeat myself over and over.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^8: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))
by LanX (Saint) on May 03, 2013 at 23:18 UTC | |
by BrowserUk (Patriarch) on May 03, 2013 at 23:22 UTC | |
by LanX (Saint) on May 04, 2013 at 00:47 UTC | |
by BrowserUk (Patriarch) on May 04, 2013 at 05:13 UTC |