in reply to Re^9: 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.
Cheers Rolf
( addicted to the Perl Programming Language)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
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 |