Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

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

by LanX (Chancellor)
on May 04, 2013 at 00:47 UTC ( #1031975=note: print w/replies, xml ) Need Help??


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.

Enjoy your million! =)

Cheers Rolf

( addicted to the Perl Programming Language)

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

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 (Pope) on May 04, 2013 at 05:13 UTC

    Enjoy your last word.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (6)
As of 2016-10-01 10:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Extraterrestrials haven't visited the Earth yet because:







    Results (575 votes). Check out past polls.