improved representation of bias

[Leo Franchi]

On 13 Dec 2008, at 22:32, Daniel Jones wrote:

> Thats right. I just meant that I don't think its practical.
>
> NP:  contains problems that can't be solved "efficiently" (or so its
> widely conjectured. If you prove, disprove it, you'll be the messiah
> of computer science and probably get a Fields medal, a Turing award,
> money, beautiful women, etc.)
>
> NP-Hard:  At least as hard as anything in NP.

Makes me nostalgic for my Theory of Computation class this spring. Oh,  
how i wish I were proving by reduction.... NOT.

leo

---
Leo Franchi				(650) 704 3680
Tufts University 2010

lfranchi at kde.org
leonardo.franchi at tufts.edu