Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

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

by BrowserUk (Pope)
on May 04, 2013 at 05:13 UTC ( #1031987=note: print w/ replies, xml ) Need Help??


in reply to Re^10: 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.

Enjoy your last word.

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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1031987]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (10)
As of 2016-05-05 16:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?