Complexity of Bezout s Theorem V: Polynomial Time

Mike Shub, Steve Smale. Complexity of Bezout s Theorem V: Polynomial Time. Theoretical Computer Science, 133(1):141-164, 1994.

Authors

Mike Shub

This author has not been identified. Look up 'Mike Shub' in Google

Steve Smale

This author has not been identified. Look up 'Steve Smale' in Google