Building above read-once polynomials: identity testing and hardness of representation. Mahajan, M.; Rao, B. V. R.; and Sreenivasaiah, K. Electronic Colloquium on Computational Complexity (ECCC), 22:202, 2015.
Building above read-once polynomials: identity testing and hardness of representation. [link]Link  Building above read-once polynomials: identity testing and hardness of representation. [link]Paper  bibtex   
@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
}
Downloads: 0