Neeraj Kayal. Efficient algorithms for some special cases of the polynomial equivalence problem. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1409-1421, SIAM, 2011. [doi]
@inproceedings{Kayal11, title = {Efficient algorithms for some special cases of the polynomial equivalence problem}, author = {Neeraj Kayal}, year = {2011}, url = {http://www.siam.org/proceedings/soda/2011/SODA11_107_kayaln.pdf}, researchr = {https://researchr.org/publication/Kayal11}, cites = {0}, citedby = {0}, pages = {1409-1421}, booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011}, editor = {Dana Randall}, publisher = {SIAM}, }