@InProceedings{bhattacharyya_et_al:LIPIcs.ESA.2016.11,
author = {Bhattacharyya, Arnab and Gadekar, Ameet and Ghoshal, Suprovat and Saket, Rishi},
title = {{On the Hardness of Learning Sparse Parities}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Sankowski, Piotr and Zaroliagis, Christos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.11},
URN = {urn:nbn:de:0030-drops-63628},
doi = {10.4230/LIPIcs.ESA.2016.11},
annote = {Keywords: Fixed Parameter Tractable, Juntas, Minimum Distance of Code, Psuedorandom Generators}
}