Login / Signup

A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function.

P. G. Walsh
Published in: Math. Comput. (2000)
Keyphrases
  • polynomial time complexity
  • np complete
  • upper bound
  • lower bound
  • database
  • image processing
  • recently developed
  • closed form expressions