Library

eCommons

 

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

Simple item page
dc.contributor.authorRenegar, J.en_US
dc.date.accessioned2007-11-09T19:15:05Z
dc.date.available2007-11-09T19:15:05Z
dc.date.issued1987-05en_US
dc.description.abstractOn the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomialsen_US
dc.format.extent5701574 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation748en_US
dc.identifier.urihttps://hdl.handle.net/1813/8631
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleOn the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomialsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR000748.pdf
Size:
5.44 MB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports