The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry)

DOI10.1137/1.9781611974768.13zbMath1430.68466OpenAlexW2569353686MaRDI QIDQ5232578

Harry Stern, Tomáš Vyskočil, Jan Dean Catarata, Scott Corbett, Zheng Zhang

Publication date: 12 September 2019

Published in: 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974768.13

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Combinatorial probability (60C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Counting Candy Crush configurations ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ The interaction light cone of the discrete Bak-Sneppen, contact and other local processes

This page was built for publication: The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry)