Add to ORKGWe 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: for a given prime number p, it computes the p-valuation of the discriminant and the factorization of p in a number field of degree 1000 in a few seconds, in a personal computer
International audienceWe study two important operations on polynomials defined over complete discret...
Newton polygons are constructions over the p-adic numbers used to find information about the roots o...
International audienceWe improve significantly the Nart-Montes algorithm for factoring polynomials o...
We present an algorithm for computing discriminants and prime ideal decomposition in number fields....
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization o...
Let K be the number field determined by a monic irreducible polynomial f(x) with integer coefficient...
Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coeffic...
0. Ore (Math. Ann. 99. 1928, 84-I 17) developed a method for obtaining the absolute discriminant and...
summary:Let $K$ be a number field defined by an irreducible polynomial $F(X)\in \mathbb Z[X]$ and $\...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
This paper presents an algorithm for calculating prime numbers in quadratic fields having the unique...
AbstractO. Ore (Math. Ann. 99, 1928, 84–117) developed a method for obtaining the absolute discrimin...
This thesis offers a clear introduction to p-adic number fields and the method of Newton polygons to...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
International audienceWe study two important operations on polynomials defined over complete discret...
Newton polygons are constructions over the p-adic numbers used to find information about the roots o...
International audienceWe improve significantly the Nart-Montes algorithm for factoring polynomials o...
We present an algorithm for computing discriminants and prime ideal decomposition in number fields....
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization o...
Let K be the number field determined by a monic irreducible polynomial f(x) with integer coefficient...
Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coeffic...
0. Ore (Math. Ann. 99. 1928, 84-I 17) developed a method for obtaining the absolute discriminant and...
summary:Let $K$ be a number field defined by an irreducible polynomial $F(X)\in \mathbb Z[X]$ and $\...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
This paper presents an algorithm for calculating prime numbers in quadratic fields having the unique...
AbstractO. Ore (Math. Ann. 99, 1928, 84–117) developed a method for obtaining the absolute discrimin...
This thesis offers a clear introduction to p-adic number fields and the method of Newton polygons to...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
International audienceWe study two important operations on polynomials defined over complete discret...
Newton polygons are constructions over the p-adic numbers used to find information about the roots o...
International audienceWe improve significantly the Nart-Montes algorithm for factoring polynomials o...