A Polynomial Time Complexity Bound for Computations on Curves

DOI10.1137/S0097539796300969zbMath0923.14033MaRDI QIDQ4210172

Peter Gareth Walsh

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

complexityPuiseux expansioncomputation of the genus of an algebraic curve

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special algebraic curves and curves of low genus (14H45) Computational aspects of algebraic curves (14Q05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Approximation to certain transcendental decimal fractions by algebraic numbers
• The Computational Complexity of the Resolution of Plane Curve Singularities
• Eisenstein's theorem on power series expansions of algebraic functions
• A quantitative version of Runge's theorem on diophantine equations
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• Irreducibility testing over local fields

This page was built for publication: A Polynomial Time Complexity Bound for Computations on Curves