"On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems ..."

James Renegar (1989)

> Home

Details and statistics

DOI: 10.1137/0218024

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Renegar89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Renegar89
James Renegar:
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials. SIAM J. Comput. 18(2): 350-370 (1989)

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.