@article{journals/eccc/ChenOS15,
  added-at = {2015-08-19T00:00:00.000+0200},
  author = {Chen, Xi and Oliveira, Igor Carboni and Servedio, Rocco A.},
  biburl = {http://www.bibsonomy.org/bibtex/2b5e341a9be67de1fdc09e0ac8486df80/dblp},
  ee = {http://eccc.hpi-web.de/report/2015/123},
  interhash = {5cc1f00c93bc2e852f663698526b2f80},
  intrahash = {b5e341a9be67de1fdc09e0ac8486df80},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  keywords = {dblp},
  pages = 123,
  timestamp = {2015-08-20T11:32:44.000+0200},
  title = {Addition is exponentially harder than counting for shallow monotone circuits.},
  url = {http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#ChenOS15},
  volume = 22,
  year = 2015
}

{"_id":"wATTJJDP5Dt5xTuwi","bibbaseid":"chen-oliveira-servedio-additionisexponentiallyharderthancountingforshallowmonotonecircuits-2015","downloads":0,"creationDate":"2016-01-22T05:24:54.599Z","title":"Addition is exponentially harder than counting for shallow monotone circuits.","author_short":["Chen, X.","Oliveira, I. C.","Servedio, R. A."],"year":2015,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Igor Sokolov?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2015-08-19T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Chen"],"firstnames":["Xi"],"suffixes":[]},{"propositions":[],"lastnames":["Oliveira"],"firstnames":["Igor","Carboni"],"suffixes":[]},{"propositions":[],"lastnames":["Servedio"],"firstnames":["Rocco","A."],"suffixes":[]}],"biburl":"http://www.bibsonomy.org/bibtex/2b5e341a9be67de1fdc09e0ac8486df80/dblp","ee":"http://eccc.hpi-web.de/report/2015/123","interhash":"5cc1f00c93bc2e852f663698526b2f80","intrahash":"b5e341a9be67de1fdc09e0ac8486df80","journal":"Electronic Colloquium on Computational Complexity (ECCC)","keywords":"dblp","pages":"123","timestamp":"2015-08-20T11:32:44.000+0200","title":"Addition is exponentially harder than counting for shallow monotone circuits.","url":"http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#ChenOS15","volume":"22","year":"2015","bibtex":"@article{journals/eccc/ChenOS15,\n added-at = {2015-08-19T00:00:00.000+0200},\n author = {Chen, Xi and Oliveira, Igor Carboni and Servedio, Rocco A.},\n biburl = {http://www.bibsonomy.org/bibtex/2b5e341a9be67de1fdc09e0ac8486df80/dblp},\n ee = {http://eccc.hpi-web.de/report/2015/123},\n interhash = {5cc1f00c93bc2e852f663698526b2f80},\n intrahash = {b5e341a9be67de1fdc09e0ac8486df80},\n journal = {Electronic Colloquium on Computational Complexity (ECCC)},\n keywords = {dblp},\n pages = 123,\n timestamp = {2015-08-20T11:32:44.000+0200},\n title = {Addition is exponentially harder than counting for shallow monotone circuits.},\n url = {http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#ChenOS15},\n volume = 22,\n year = 2015\n}\n\n","author_short":["Chen, X.","Oliveira, I. C.","Servedio, R. A."],"key":"journals/eccc/ChenOS15","id":"journals/eccc/ChenOS15","bibbaseid":"chen-oliveira-servedio-additionisexponentiallyharderthancountingforshallowmonotonecircuits-2015","role":"author","urls":{"Link":"http://eccc.hpi-web.de/report/2015/123","Paper":"http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#ChenOS15"},"keyword":["dblp"],"downloads":0,"html":""},"search_terms":["addition","exponentially","harder","counting","shallow","monotone","circuits","chen","oliveira","servedio"],"keywords":["dblp"],"authorIDs":[],"dataSources":["h2zaCTy5Y74MDBFyN"]}