Polynomial complexity of the Newton-Puiseux algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 233 LNCS, Issue , 1986, Pages 247-255

  Chistov, A L ^a  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000868828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0016248     Document Type: Conference Paper

References (2)

1. S.S. Abhyankar and T.T. Moh. Newton-Puiseux expansion and generalized Tchirnhausen transformation.-J.reine angew.Math. 1973 vol.260 p.47-83 and 1973 vol.261 p.29-54.
2. H.T. Kung and J.F. Traub. All algebraic functions can be computed fast.-J.Assoc.Comp.Mach. 1978 vol.25 N 2 p.245-260.