Sciweavers

CORR
2006
Springer

The complexity of class polynomial computation via floating point approximations

13 years 11 months ago
The complexity of class polynomial computation via floating point approximations
Andreas Enge
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Andreas Enge
Comments (0)