Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Re: (Golf) Minimizing the Bacon Number

by Masem (Monsignor)
on May 14, 2001 at 23:35 UTC ( #80305=note: print w/replies, xml ) Need Help??

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

This problem shouldn't be NP-complete. A well-rounded algorithm is going to be, I believe, O(N^2) or O(N^3). However, the golf solution will probably be NP.
Dr. Michael K. Neylon - || "You've left the lens cap of your mind on again, Pinky" - The Brain
  • Comment on Re: Re: (Golf) Minimizing the Bacon Number

Replies are listed 'Best First'.
Re: Re: Re: (Golf) Minimizing the Bacon Number
by bobione (Pilgrim) on May 15, 2001 at 01:32 UTC
    Sorry to ask but my curiosity is too big...
    What is NP (or NP-complete) ?

    BobiOne KenoBi ;)

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

      Search Google: NP-complete

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (4)
As of 2020-01-24 07:24 GMT
Find Nodes?
    Voting Booth?