Polynomial complexity algorithms for computational problems in the theory of algebraic curves
type: Item
instance of: scholarly article
title: Polynomial complexity algorithms for computational problems in the theory of algebraic curves
zbMATH Open document ID: 0779.14024
DOI: 10.1007/BF01104109
author: A. L. Chistov
published in: Journal of Soviet Mathematics
publication date: 1993-09-15T00:00:00Z
review text: See the review in Zbl 0755.14017.
Mathematics Subject Classification ID: 14Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 14M25
zbMATH DE Number: 416599
zbMATH Keywords: algorithm
zbMATH Keywords: Newton--Puiseux expansion
zbMATH Keywords: roots of a polynomial
zbMATH Keywords: Newton polygon method
zbMATH Keywords: polynomial complexity
zbMATH Keywords: polynomial-time algorithms
MaRDI profile type: Publication
cites work: Q5184990
cites work: Q3475342
cites work: All Algebraic Functions Can Be Computed Fast
description: scientific article; zbMATH DE number 416599