scientific article; zbMATH DE number 5154
From MaRDI portal
Publication:4712895
zbMath0755.14017MaRDI QIDQ4712895
Publication date: 25 June 1992
Full work available at URL: https://eudml.org/doc/68048
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmNewton polygoninertiapolynomial complexityNewton-Puiseux expansionformal power seriespolynomial-time algorithmsroots of a polynomialNewton polygon methodgeometrical genus of a curveindices of ramificationlocal rings of points of algebraic curvesnormalization of an algebraic curve
Analysis of algorithms and problem complexity (68Q25) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational aspects of algebraic curves (14Q05)
Related Items (2)
Algorithm of polynomial complexity for factoring polynomials over local fields ⋮ Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic
This page was built for publication: