"Newton's method and the Computational Complexity of the Fundamental ..."

Prashant Batra (2007)

> Home

Details and statistics

DOI: 10.1016/J.ENTCS.2008.03.016

access: open

type: Conference or Workshop Paper

metadata version: 2023-02-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entcs/Batra08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/Batra08
Prashant Batra:
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. CCA 2007: 201-218

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.