Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity

Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi. Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Electronic Colloquium on Computational Complexity (ECCC), 23:45, 2016. [doi]

@article{ForbesKS16,
  title = {Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity},
  author = {Michael A. Forbes and Mrinal Kumar and Ramprasad Saptharishi},
  year = {2016},
  url = {http://eccc.hpi-web.de/report/2016/045},
  researchr = {https://researchr.org/publication/ForbesKS16},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {23},
  pages = {45},
}