On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials

From MaRDI portal
Publication:3831940

DOI10.1137/0218024zbMath0676.65045OpenAlexW2011374998MaRDI QIDQ3831940

James Renegar

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/8631



Related Items