Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

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

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


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.


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^7: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))
Re^8: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))
by LanX (Canon) on May 03, 2013 at 23:18 UTC
    > 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.

    Apparently clearer and with less words.

    I tried to read it again and gave up.

    > > Well, bad trained personnel!

    > You'd know. YOU are one of them.

    hdb was pretty clear that you would win this contest, if your algorithm did what you are claimingı it does.

    You denied it.

    I don't enjoy discussing with your propaganda machine, but from a logical POV thats plain wrong!

    Somebody needed to say it, no matter how many insults your piling on people with other opinions.

    plonk

    Cheers Rolf

    ( addicted to the Perl Programming Language)

    1) "This will very quickly (less than 0.001 of a second) find a solution, if one exists, for sets of 100s or 1000s of elements."

      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.
        Enjoy your million! =)

        Cheers Rolf

        ( addicted to the Perl Programming Language)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (9)
As of 2014-07-11 02:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (217 votes), past polls