Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

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

by BrowserUk (Pope)
on May 03, 2013 at 23:22 UTC ( #1031971=note: print w/ replies, xml ) Need Help??


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

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 (Chancellor) on May 04, 2013 at 00:47 UTC
    Enjoy your million! =)

    Cheers Rolf

    ( addicted to the Perl Programming Language)

      Enjoy your last word.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (16)
As of 2016-06-28 18:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (360 votes). Check out past polls.