Elsevier

Theoretical Computer Science

Volume 133, Issue 1, 10 October 1994, Pages 141-164
Theoretical Computer Science

Complexity of Bezout's theorem V: polynomial time

https://doi.org/10.1016/0304-3975(94)90122-8Get rights and content
Under an Elsevier user license
open archive

Abstract

We show that there are algorithms which find an approximate zero of a system of polynomial equations and which function in polynomial time on the average. The number of arithmetic operations is cN4s, where N is the input size and c a universal constant.

Cited by (0)

Supported in part by NSF, IBM, and CRM (Barcelona).