@InProceedings{potukuchi:LIPIcs.FSTTCS.2019.25,
author = {Potukuchi, Aditya},
title = {{On the AC^0\lbrackoplus\rbrack Complexity of Andreev’s Problem}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.25},
URN = {urn:nbn:de:0030-drops-115879},
doi = {10.4230/LIPIcs.FSTTCS.2019.25},
annote = {Keywords: List Recovery, Sharp Threshold, Fourier Analysis}
}