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

Replies are listed 'Best First'.
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...	[reply]
Re: Re: Re: Re: (Golf) Minimizing the Bacon Number by MeowChow (Vicar) on May 15, 2001 at 03:15 UTC
Here's one definition. MeowChow s aamecha.s a..a\u$&owag.print	[reply]
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.	[reply]


Do you know where your variables are?
	PerlMonks