Complexity Analysis of Root Clustering for a Complex Polynomial. Becker, R., Sagraloff, M., Sharma, V., Xu, J., & Yap, C. In Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 71–78, 2016.
Complexity Analysis of Root Clustering for a Complex Polynomial [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/issac/BeckerS0XY16,
	author = {Ruben Becker and Michael Sagraloff and Vikram Sharma and Juan Xu and Chee Yap},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/issac/BeckerS0XY16.bib},
	booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22, 2016},
	crossref = {DBLP:conf/issac/2016},
	doi = {10.1145/2930889.2930939},
	pages = {71--78},
	timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
	title = {Complexity Analysis of Root Clustering for a Complex Polynomial},
	url = {https://doi.org/10.1145/2930889.2930939},
	year = {2016},
	bdsk-url-1 = {https://doi.org/10.1145/2930889.2930939}}

Downloads: 0