A Polynomial Time Complexity Bound for Computations on Curves
From MaRDI portal
Publication:4210172
DOI10.1137/S0097539796300969zbMath0923.14033MaRDI QIDQ4210172
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
14H45: Special algebraic curves and curves of low genus
14Q05: Computational aspects of algebraic curves
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item