{"volume":"2016-December","publist_id":"6158","year":"2016","acknowledgement":"European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160","project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"doi":"10.1109/FOCS.2016.88","publication":"Proceedings - Annual IEEE Symposium on Foundations of Computer Science","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"external_id":{"arxiv":["1506.08547"]},"ec_funded":1,"citation":{"short":"V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.","apa":"Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2016–December). New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>","ista":"Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, Vol. 2016–December. IEEE, 2016. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2016-December. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, New Brunswick, NJ, USA , 2016, vol. 2016–December.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2016–December, 7782993, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>."},"conference":{"start_date":"2016-09-09","name":"FOCS: Foundations of Computer Science","location":"New Brunswick, NJ, USA ","end_date":"2016-09-11"},"language":[{"iso":"eng"}],"article_number":"7782993","_id":"1193","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:50:38Z","oa":1,"oa_version":"Preprint","scopus_import":1,"publisher":"IEEE","related_material":{"record":[{"status":"public","relation":"later_version","id":"5975"}]},"status":"public","quality_controlled":"1","title":"Commutativity in the algorithmic Lovasz local lemma","day":"15","type":"conference","date_updated":"2023-09-19T14:24:57Z","article_processing_charge":"No","month":"12","date_published":"2016-12-15T00:00:00Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547v7"}],"abstract":[{"text":"We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid &quot;bad features&quot;, or &quot;flaws&quot;. It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and &quot;resamples&quot; it using a &quot;resampling oracle&quot; provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new &quot;commutativity&quot; condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately.","lang":"eng"}],"department":[{"_id":"VlKo"}]}