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.

No reviews for this publication, yet.