From: Lou Vanek <vanek@...>
Date: 2006-02-09T06:35:18+09:00
Subject: Re: [ANN] NP

Phil Tomson wrote:

> In article <43E9F3BF.5080909@acd.net>, Lou Vanek  <vanek@acd.net> 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
> 
> 
> Cool.  Though I was hoping that perhaps you were going to announce that P=NP 
> ;-)
> 
> Phil

Many, many more problems will seem to run in polynomial time. Psuedo-Polynomial
time, if you will. NP = PP? Heh.

-lv