Abstract
Smale’s 17th problem asks: “Can a zero of n n complex polynomial equations in n n unknowns be found approximately, on the average, in polynomial time with a uniform algorithm?” We give a positive answer to this question. Namely, we describe a uniform probabilistic algorithm that computes an approximate zero of systems of polynomial equations f : C n ⟶ C n f:\mathbb {C}^n\longrightarrow \mathbb {C}^n , performing a number of arithmetic operations which is polynomial in the size of the input, on the average.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
