论文信息 - Polynomial Complexity of the Newton-Puiseux Algorithm - 字舞流文

Polynomial Complexity of the Newton-Puiseux Algorithm

Alexander L. Chistov

[1] H. T. Kung,et al. All Algebraic Functions Can Be Computed Fast , 1978, JACM.