AbstractIn this paper we present a generic algorithm for factoring polynomials over global fields F. As efficient implementations of that algorithm for number fields and function fields differ substantially, these cases will be treated separately. Complexity issues and implementations will be discussed in part II which also contains illustrative examples
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
We present an algorithm to factor multivariate polynomials over algebraic number fields that is poly...
This survey reviews several algorithms for the factorization of univariate polynomials over finite f...
AbstractIn this paper we describe software for an efficient factorization of polynomials over global...
This paper provides an overview on existing algorithms for factoring polynomials over global fields ...
AbstractWe describe an efficient new algorithm for factoring a polynomial Φ(x) over a fieldkthat is ...
AbstractThis survey reviews several algorithms for the factorization of univariate polynomials over ...
The problem of exact polynomial factorization, in other words expressing a polynomial as a product o...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. ...
AbstractWe exhibit a deterministic algorithm for factoring polynomials in one variable over finite f...
If K/k is a function field in one variable of positive characteristic, we describe a general algori...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
AbstractWe consider the problem of factoring univariate polynomials over a finite field. We demonstr...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
We present an algorithm to factor multivariate polynomials over algebraic number fields that is poly...
This survey reviews several algorithms for the factorization of univariate polynomials over finite f...
AbstractIn this paper we describe software for an efficient factorization of polynomials over global...
This paper provides an overview on existing algorithms for factoring polynomials over global fields ...
AbstractWe describe an efficient new algorithm for factoring a polynomial Φ(x) over a fieldkthat is ...
AbstractThis survey reviews several algorithms for the factorization of univariate polynomials over ...
The problem of exact polynomial factorization, in other words expressing a polynomial as a product o...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. ...
AbstractWe exhibit a deterministic algorithm for factoring polynomials in one variable over finite f...
If K/k is a function field in one variable of positive characteristic, we describe a general algori...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
AbstractWe consider the problem of factoring univariate polynomials over a finite field. We demonstr...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
We present an algorithm to factor multivariate polynomials over algebraic number fields that is poly...
This survey reviews several algorithms for the factorization of univariate polynomials over finite f...
DOI
Add to ORKG