- This page was last edited on 7 July 2018, at 03:39.
- Content is available under Attribution-NonCommercial-ShareAlike 3.0 Unported unless otherwise noted.
In mathematics and theoretical computer science, entropy compression is an information theoretic method for proving that a random process terminates, originally used by Robin Moser to prove an algorithmic version of the Lovász local lemma.
