Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

61

Voted

MOC
2011

favoriteEmaildiscussreport

194views Intelligent Agents» more MOC 2011»

Computing Hilbert class polynomials with the Chinese remainder theorem

14 years 4 months ago

Computing Hilbert class polynomials with the Chinese remainder theorem

Download eprint.iacr.org

Andrew V. Sutherland

Real-time Traffic

Intelligent Agents | MOC 2011 |

claim paper

Related Content

» Computing Hilbert Class Polynomials

» Efficient Multiplication of Polynomials on Graphics Hardware

» Do Noetherian Modules Have Noetherian Basis Functions

» A polytime proof of correctness of the RabinMiller algorithm from Fermats little theorem

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	MOC
Authors	Andrew V. Sutherland

Comments (0)