@article{journals/eccc/MahajanRS15,
  added-at = {2015-12-29T00:00:00.000+0100},
  author = {Mahajan, Meena and Rao, B. V. Raghavendra and Sreenivasaiah, Karteek},
  biburl = {http://www.bibsonomy.org/bibtex/281a84a521a3989dd97171f346b61c8dd/dblp},
  ee = {http://eccc.hpi-web.de/report/2015/202},
  interhash = {34b8a868f5f02f23414176de2bbcb70e},
  intrahash = {81a84a521a3989dd97171f346b61c8dd},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  keywords = {dblp},
  pages = 202,
  timestamp = {2015-12-30T11:34:23.000+0100},
  title = {Building above read-once polynomials: identity testing and hardness of representation.},
  url = {http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#MahajanRS15},
  volume = 22,
  year = 2015
}

{"_id":"6wSjHkymijQqiCkFG","bibbaseid":"mahajan-rao-sreenivasaiah-buildingabovereadoncepolynomialsidentitytestingandhardnessofrepresentation-2015","downloads":0,"creationDate":"2016-02-09T06:01:10.872Z","title":"Building above read-once polynomials: identity testing and hardness of representation.","author_short":["Mahajan, M.","Rao, B. V. R.","Sreenivasaiah, K."],"year":2015,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Krishnakumar, V?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2015-12-29T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Mahajan"],"firstnames":["Meena"],"suffixes":[]},{"propositions":[],"lastnames":["Rao"],"firstnames":["B.","V.","Raghavendra"],"suffixes":[]},{"propositions":[],"lastnames":["Sreenivasaiah"],"firstnames":["Karteek"],"suffixes":[]}],"biburl":"http://www.bibsonomy.org/bibtex/281a84a521a3989dd97171f346b61c8dd/dblp","ee":"http://eccc.hpi-web.de/report/2015/202","interhash":"34b8a868f5f02f23414176de2bbcb70e","intrahash":"81a84a521a3989dd97171f346b61c8dd","journal":"Electronic Colloquium on Computational Complexity (ECCC)","keywords":"dblp","pages":"202","timestamp":"2015-12-30T11:34:23.000+0100","title":"Building above read-once polynomials: identity testing and hardness of representation.","url":"http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#MahajanRS15","volume":"22","year":"2015","bibtex":"@article{journals/eccc/MahajanRS15,\n added-at = {2015-12-29T00:00:00.000+0100},\n author = {Mahajan, Meena and Rao, B. V. Raghavendra and Sreenivasaiah, Karteek},\n biburl = {http://www.bibsonomy.org/bibtex/281a84a521a3989dd97171f346b61c8dd/dblp},\n ee = {http://eccc.hpi-web.de/report/2015/202},\n interhash = {34b8a868f5f02f23414176de2bbcb70e},\n intrahash = {81a84a521a3989dd97171f346b61c8dd},\n journal = {Electronic Colloquium on Computational Complexity (ECCC)},\n keywords = {dblp},\n pages = 202,\n timestamp = {2015-12-30T11:34:23.000+0100},\n title = {Building above read-once polynomials: identity testing and hardness of representation.},\n url = {http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#MahajanRS15},\n volume = 22,\n year = 2015\n}\n\n","author_short":["Mahajan, M.","Rao, B. V. R.","Sreenivasaiah, K."],"key":"journals/eccc/MahajanRS15","id":"journals/eccc/MahajanRS15","bibbaseid":"mahajan-rao-sreenivasaiah-buildingabovereadoncepolynomialsidentitytestingandhardnessofrepresentation-2015","role":"author","urls":{"Link":"http://eccc.hpi-web.de/report/2015/202","Paper":"http://dblp.uni-trier.de/db/journals/eccc/eccc22.html#MahajanRS15"},"keyword":["dblp"],"downloads":0},"search_terms":["building","above","read","once","polynomials","identity","testing","hardness","representation","mahajan","rao","sreenivasaiah"],"keywords":["dblp"],"authorIDs":[],"dataSources":["qcwuM7Zzcbynrts5v"]}