Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

RE: Re: Packaging Algorithm

by rlk (Pilgrim)
on Nov 08, 2000 at 02:36 UTC ( #40435=note: print w/replies, xml ) Need Help??

in reply to Re: Packaging Algorithm
in thread Packaging Algorithm

Remember, just because a problem is NP, doesn't mean it's unsolvable. It just means that there's no (known) way to solve it in polynomial time. All we can do in polynomial time is verify a solution.

There's no reason that one couldn't write an algorithm to solve this problem. The problem is that for any non-trivial number of boxes, it would take a long, long time and/or some pretty expensive hardware to run that algorithm.

Ryan Koppenhaver, Aspiring Perl Hacker
"I ask for so little. Just fear me, love me, do as I say and I will be your slave."

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (7)
As of 2020-10-01 09:02 GMT
Find Nodes?
    Voting Booth?
    If at first I donít succeed, I Ö

    Results (177 votes). Check out past polls.