| Display title | Entropy compression |
| Default sort key | Entropy compression |
| Page length (in bytes) | 9,954 |
| Namespace ID | 0 |
| Page ID | 46257389 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Wikidata item ID | Q22908168 |
| Central description | 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 |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | David Eppstein (talk | contribs) |
| Date of page creation | 07:11, 29 March 2015 |
| Latest editor | David Eppstein (talk | contribs) |
| Date of latest edit | 07:22, 27 December 2024 |
| Total number of edits | 13 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded templates (14) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
