improved representation of bias

[Daniel Jones]

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.

On Sat, Dec 13, 2008 at 8:54 AM, Leo Franchi <lfranchi at kde.org> wrote:
> On 13 Dec 2008, at 16:50, Big O wrote:
>
>>
>> On Dec 12, 2008, at 7:50 PM, Daniel Jones wrote:
>>> chart, it would be, in general, an intractable (very much in NP-hard)
>> what?
>
> NP-hard = only way to solve it is to brute force iterate through all
> possibilities, no possible algorithm exists for computing the result
> in shorter time. (that is my attempt at paraphrasing a complexity
> class.... may be wrong i dont know)
>
> leo
>
> ---
> Leo Franchi                             (650) 704 3680
> Tufts University 2010
>
> lfranchi at kde.org
> leonardo.franchi at tufts.edu
>
> _______________________________________________
> Amarok mailing list
> Amarok at kde.org
> https://mail.kde.org/mailman/listinfo/amarok
>