A Polynomial Time Complexity Bound for Computations on Curves
In this paper, we use a recent quantitative version of Eisenstein's theorem on power series expansions of algebraic functions to compute a polynomial-time bit complexity bound for the computation of the genus of an algebraic curve over the rationals. The result is extendable to any field of characteristic zero which is finitely generated over the rationals.