Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields

Jordi Guàrdia, Jesús Montes, Enric Nart

Research output: Contribution to journalArticleResearchpeer-review

19 Citations (Scopus)

Abstract

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good.
Original languageEnglish
Pages (from-to)667-696
JournalJournal de Theorie des Nombres de Bordeaux
Volume23
Issue number3
DOIs
Publication statusPublished - 1 Jan 2011

Fingerprint

Dive into the research topics of 'Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields'. Together they form a unique fingerprint.

Cite this