Pages that link to "Item:Q405191"
From MaRDI portal
The following pages link to Application of entropy compression in pattern avoidance (Q405191):
Displaying 12 items.
- Generating square-free words efficiently (Q496050) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Compressibility and probabilistic proofs (Q2011640) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Avoidability of palindrome patterns (Q2223455) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
- Doubled patterns with reversal and square-free doubled patterns (Q2699639) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- A short proof that shuffle squares are 7-avoidable (Q3186679) (← links)
