Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. Batra, P. In Dillhage, R., Grubba, T., Sorbi, A., Weihrauch, K., & Zhong, N., editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202, pages 201–218, 2008. Elsevier. CCA 2007, Siena, Italy, June 16–18, 2007
bibtex   
@INPROCEEDINGS{Bat08,
  author = {Batra, Prashant},
  title = {Newton's method and the Computational Complexity of the Fundamental
	Theorem of Algebra},
  booktitle = {Proceedings of the Fourth International Conference on Computability
	and Complexity in Analysis ({CCA} 2007)},
  year = {2008},
  editor = {Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
	Klaus and Zhong, Ning},
  volume = {202},
  series = ENTCS,
  pages = {201--218},
  publisher = {Elsevier},
  note = {CCA 2007, Siena, Italy, June 16--18, 2007},
  keywords = {bib,cca}
}

Downloads: 0