From: Edgardo Hames <ehames@...>
Date: 2006-02-09T02:20:23+09:00
Subject: Re: [ANN] NP

On 2/8/06, Gregory Seidman <gsslist+ruby@anthropohedron.net> wrote:
> On Wed, Feb 08, 2006 at 10:36:01PM +0900, Lou Vanek wrote:
> } If anybody else finds NP-complete problems interesting then you may want
> } to check out my new Ruby extension. You can find the extension, ext_np, at
> } http://rubyforge.org/frs/?group_id=835
> }
> } The description follows in the README.
> } This extension is wicked fast.
> }
> } -lv
> }
> } ----------------------------------------------------------------------------
> } README.txt
> }
> } This extension, 'NP,' is a module for the Ruby language. It includes four
> } optimized NP-complete algorithms:
> }
> }     o    Multiple Knapsack 0-1
> }     o    Subset Sum
> }     o    Symmetric Subset Sum
> }     o    Satisfiability (SAT)
>
> So does this mean there won't be any more Ruby Quizzes based on NP-complete
> problems? Please? I mean, if you've solved one, you've solved them all.


One implementation to solve them all ;-)

Now, what other programming language has this feature?

Cheers,
Ed
--
Encontr� a "Tu psic�pata favorito" http://tuxmaniac.blogspot.com
	
Thou shalt study thy libraries and strive not to reinvent them without cause,
that thy code may be short and readable and thy days pleasant and productive.
-- Seventh commandment for C programmers