@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}
}

{"_id":"4wNLXuthc9H6rHYAw","bibbaseid":"forbes-kumar-saptharishi-functionallowerboundsforarithmeticcircuitsandconnectionstobooleancircuitcomplexity-2016","authorIDs":[],"author_short":["Forbes, M. A.","Kumar, M.","Saptharishi, R."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Michael","A."],"propositions":[],"lastnames":["Forbes"],"suffixes":[]},{"firstnames":["Mrinal"],"propositions":[],"lastnames":["Kumar"],"suffixes":[]},{"firstnames":["Ramprasad"],"propositions":[],"lastnames":["Saptharishi"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/eccc/ForbesKS16,\n author = {Michael A. Forbes and\n Mrinal Kumar and\n Ramprasad Saptharishi},\n title = {Functional lower bounds for arithmetic circuits and connections to\n boolean circuit complexity},\n journal = {Electronic Colloquium on Computational Complexity {(ECCC)}},\n volume = {23},\n pages = {45},\n year = {2016},\n url = {http://eccc.hpi-web.de/report/2016/045},\n timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/eccc/ForbesKS16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Forbes, M. A.","Kumar, M.","Saptharishi, R."],"key":"DBLP:journals/eccc/ForbesKS16","id":"DBLP:journals/eccc/ForbesKS16","bibbaseid":"forbes-kumar-saptharishi-functionallowerboundsforarithmeticcircuitsandconnectionstobooleancircuitcomplexity-2016","role":"author","urls":{"Paper":"http://eccc.hpi-web.de/report/2016/045"},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/93/9942.bib","creationDate":"2020-02-25T21:38:49.765Z","downloads":0,"keywords":[],"search_terms":["functional","lower","bounds","arithmetic","circuits","connections","boolean","circuit","complexity","forbes","kumar","saptharishi"],"title":"Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity","year":2016,"dataSources":["vqpLxDotj5ZmjWXjK"]}