Algorithm that makes maximum compression of completly diffused data.

Joshua Landau joshua at landau.ws
Sun Nov 3 10:51:09 EST 2013

Previous message (by thread): Algorithm that makes maximum compression of completly diffused data.
Next message (by thread): Algorithm that makes maximum compression of completly diffused data.
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

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

By which I mean 2N items.

Previous message (by thread): Algorithm that makes maximum compression of completly diffused data.
Next message (by thread): Algorithm that makes maximum compression of completly diffused data.
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the Python-list mailing list