Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma

DOI10.1137/1.9781611974782.77zbMath1409.68320OpenAlexW2531532349MaRDI QIDQ4575819

David G. Harris

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Combinatorial probability (60C05) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)

Related Items (1)

Deterministic parallel algorithms for bilinear objective functions

This page was built for publication: Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma