Re: Algorithm that makes maximum compression of completly diffused data.

On 3 November 2013 15:34, Joshua Landau <jos...@landau.ws> wrote:
>I can genuinely compress
> the whole structure by N log2 Y items.


By which I mean 2N items.
-- 
https://mail.python.org/mailman/listinfo/python-list

Reply via email to