The complexity of class polynomial computation via floating point approximations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Enge, Andreas
Format:	Preprint
Published:	2006
Subjects:	Numerical Analysis Symbolic Computation Number Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/cs/0601104