The complexity of class polynomial computation via floating point approximations

Andreas Enge The complexity of class polynomial computation via floating point approximations http://arxiv.org/abs/cs/0601104 2006 CoRR abs/cs/0601104 db/journals/corr/corr0601.html#abs-cs-0601104 informal publication