@InProceedings{harsha_et_al:LIPIcs.APPROX-RANDOM.2016.32,
  author =	{Harsha, Prahladh and Srinivasan, Srikanth},
  title =	{{On Polynomial Approximations to AC^0}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
  pages =	{32:1--32:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-018-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{60},
  editor =	{Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.32},
  URN =		{urn:nbn:de:0030-drops-66550},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2016.32},
  annote =	{Keywords: Constant-depth Boolean circuits, Polynomials over reals, pseudo-random generators, k-wise independence}
}