Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma

DOI10.4171/AIHPD/51zbMath1391.05253arXiv1601.05389WikidataQ125020078 ScholiaQ125020078MaRDI QIDQ1645018

Aldo Procacci, Rémy Sanchis

Publication date: 28 June 2018

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.05389

zbMATH Keywords

algorithmic Lovász local lemmahard-core lattice gasHash families

Mathematics Subject Classification ID

Cryptography (94A60) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Randomized algorithms (68W20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Entropy compression versus Lovász local lemma

This page was built for publication: Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma