Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: Re: Re: (Golf) Minimizing the Bacon Number

by jynx (Priest)
on May 15, 2001 at 03:15 UTC ( #80398=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: (Golf) Minimizing the Bacon Number
in thread (Golf) Minimizing the Bacon Number


An NP problem is a programming problem that can only be solved by the theoretical nondeterministic Turing machine (NP stands for Nondeterministic Polynomial). An NP-Complete problem has the property that if you can find a polynomial running time solution to this problem than you can find a polynomial solution to all other NP problems as well. Unfortunately, that works both ways, if you prove that there is no polynomial solution to the problem than all other NP problems don't have a polynomial runtime as well.

For more information, look here.

Hope This Helps,
jynx

Update: D'oh! Beaten by MeowChow...


Comment on Re: Re: Re: Re: (Golf) Minimizing the Bacon Number

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (11)
As of 2014-12-18 22:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (67 votes), past polls