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

Article Details
Title:	Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma
Article URLs:	https://doi.org/10.1137/1.9781611974782.77 http://dl.acm.org/citation.cfm?id=3039763
Alternative Article URLs:
Authors:	David G. Harris	University of Maryland - College Park, Department of Computer Science
Sharing:	Unknown
Verification:	Author has not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1010789, 1422569
DBLP Key:	conf/soda/Harris17
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2017