Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

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

by bobione (Pilgrim)
on May 15, 2001 at 01:32 UTC ( #80358=note: print w/ replies, xml ) Need Help??


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

Sorry to ask but my curiosity is too big...
What is NP (or NP-complete) ?
Thanks.

BobiOne KenoBi ;)


Comment on Re: Re: Re: (Golf) Minimizing the Bacon Number
Re: Re: Re: Re: (Golf) Minimizing the Bacon Number
by MeowChow (Vicar) on May 15, 2001 at 03:15 UTC
Re: Re: Re: Re: (Golf) Minimizing the Bacon Number
by jynx (Priest) on May 15, 2001 at 03:15 UTC

    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...

Re: Re: Re: Re: (Golf) Minimizing the Bacon Number
by koolade (Pilgrim) on May 15, 2001 at 06:28 UTC

    Search Google: NP-complete

    Update: Didn't see the above posts...whoops.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (7)
As of 2014-10-21 03:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (95 votes), past polls