Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

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,

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

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2015-11-26 06:54 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (696 votes), past polls