Polynomial complexity algorithms for computational problems in the theory of algebraic curves

DOI10.1007/BF01104109zbMath0779.14024MaRDI QIDQ684961

Alexander L. Chistov

Publication date: 15 September 1993

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmpolynomial complexitypolynomial-time algorithmsroots of a polynomialNewton polygon methodNewton--Puiseux expansion

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• All Algebraic Functions Can Be Computed Fast

This page was built for publication: Polynomial complexity algorithms for computational problems in the theory of algebraic curves