Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Forbes, M. A., Kumar, M., & Saptharishi, R. Electronic Colloquium on Computational Complexity (ECCC), 23:45, 2016.
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity [link]Paper  bibtex   
@article{DBLP:journals/eccc/ForbesKS16,
  author    = {Michael A. Forbes and
               Mrinal Kumar and
               Ramprasad Saptharishi},
  title     = {Functional lower bounds for arithmetic circuits and connections to
               boolean circuit complexity},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {45},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/045},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ForbesKS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0