Complexity of Bezout's theorem V: polynomial time
Under an Elsevier user license
open archive
Cited by (0)
- ∗
Supported in part by NSF, IBM, and CRM (Barcelona).
Copyright © 1994 Published by Elsevier B.V.
Supported in part by NSF, IBM, and CRM (Barcelona).