Complexity of Bezout's Theorem V: Polynomial Time.

Mike Shub Steve Smale

Published in: Theor. Comput. Sci. (1994)

Keyphrases

worst case
computational complexity
special case
np hardness
polynomial size
database
polynomial hierarchy