improved representation of bias

[Leo Franchi]

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