On the AC^0[oplus] Complexity of Andreev’s Problem

Author Aditya Potukuchi

Thumbnail PDF


  • Filesize: 0.56 MB
  • 14 pages

Document Identifiers

Author Details

Aditya Potukuchi
  • Department of Computer Science, Rutgers University, USA


I would like to thank Swastik Kopparty for the discussions that led to Section 5, and Bhargav Narayanan for the discussions that led to Theorem 8.

Cite AsGet BibTex

Aditya Potukuchi. On the AC^0[oplus] Complexity of Andreev’s Problem. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


Andreev’s Problem is the following: Given an integer d and a subset of S subset F_q x F_q, is there a polynomial y = p(x) of degree at most d such that for every a in F_q, (a,p(a)) in S? We show an AC^0[oplus] lower bound for this problem. This problem appears to be similar to the list recovery problem for degree-d Reed-Solomon codes over F_q which states the following: Given subsets A_1,...,A_q of F_q, output all (if any) the Reed-Solomon codewords contained in A_1 x *s x A_q. In particular, we study this problem when the lists A_1, ..., A_q are randomly chosen, and are of a certain size. This may be of independent interest.

Subject Classification

ACM Subject Classification
  • Theory of computation → Circuit complexity
  • List Recovery
  • Sharp Threshold
  • Fourier Analysis


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Rohit Agrawal. Coin Theorems and the Fourier Expansion. CoRR, abs/1906.03743, 2019. URL: http://arxiv.org/abs/1906.03743.
  2. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, and Detlef Ronneburger. Power from Random Strings. SIAM J. Comput., 35(6):1467-1493, 2006. URL: https://doi.org/10.1137/050628994.
  3. Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, New York, NY, USA, 1st edition, 2009. Google Scholar
  4. Andrej Bogdanov and Muli Safra. Hardness Amplification for Errorless Heuristics. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007)., pages 418-426, 2007. URL: https://doi.org/10.1109/FOCS.2007.25.
  5. J. Brody and E. Verbin. The Coin Problem and Pseudorandomness for Branching Programs. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 30-39, October 2010. Google Scholar
  6. Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, and Avishay Tal. Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, pages 22:1-22:15, 2019. URL: https://doi.org/10.4230/LIPIcs.ITCS.2019.22.
  7. Ehud Friedgut and Gil Kalai. Every Monotone Graph Property Has A Sharp Threshold, 1996. Google Scholar
  8. Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, and Avishay Tal. AC^0[p] Lower Bounds Against MCSP via the Coin Problem. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, pages 66:1-66:15, 2019. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.66.
  9. Shuichi Hirahara and Rahul Santhanam. On the Average-case Complexity of MCSP and Its Variants. In Proceedings of the 32Nd Computational Complexity Conference, CCC '17, pages 7:1-7:20, 2017. Google Scholar
  10. Svante Janson, Tomasz Łuczak, and Andrej Rucinski. Preliminaries. John Wiley, New York, 2000. Google Scholar
  11. David S Johnson. The NP-completeness Column: An Ongoing Guide. J. Algorithms, 7(2):289-305, June 1986. Google Scholar
  12. Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, and S. Venkitesh. A fixed-depth size-hierarchy theorem for AC^0[⊕] via the coin problem. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pages 442-453, 2019. URL: https://doi.org/10.1145/3313276.3316339.
  13. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, New York, NY, USA, 2014. Google Scholar
  14. Ronen Shaltiel and Emanuele Viola. Hardness Amplification Proofs Require Majority. SIAM J. Comput., 39(7):3122-3154, July 2010. Google Scholar
  15. Terence Tao and Van H. Vu. Additive Combinatorics. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2006. URL: https://doi.org/10.1017/CBO9780511755149.
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail