A super-polynomial lower bound for regular arithmetic formulas

Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi. A super-polynomial lower bound for regular arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 20:91, 2013. [doi]

@article{KayalSS13,
  title = {A super-polynomial lower bound for regular arithmetic formulas},
  author = {Neeraj Kayal and Chandan Saha and Ramprasad Saptharishi},
  year = {2013},
  url = {http://eccc.hpi-web.de/report/2013/091},
  researchr = {https://researchr.org/publication/KayalSS13},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {20},
  pages = {91},
}