Doru Stefanescu. A New Polynomial Bound and Its Efficiency. In Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 17th International Workshop, CASC 2015, Aachen, Germany, September 14-18, 2015, Proceedings. Volume 9301 of Lecture Notes in Computer Science, pages 457-467, Springer, 2015. [doi]
@inproceedings{Stefanescu15-0, title = {A New Polynomial Bound and Its Efficiency}, author = {Doru Stefanescu}, year = {2015}, doi = {10.1007/978-3-319-24021-3_33}, url = {http://dx.doi.org/10.1007/978-3-319-24021-3_33}, researchr = {https://researchr.org/publication/Stefanescu15-0}, cites = {0}, citedby = {0}, pages = {457-467}, booktitle = {Computer Algebra in Scientific Computing - 17th International Workshop, CASC 2015, Aachen, Germany, September 14-18, 2015, Proceedings}, editor = {Vladimir P. Gerdt and Wolfram Koepf and Werner M. Seiler and Evgenii V. Vorozhtsov}, volume = {9301}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-319-24020-6}, }