AbstractWe describe an efficient new algorithm for factoring a polynomial Φ(x) over a fieldkthat is complete with respect to a discrete prime divisor. For every irreducible factorϕ (x) of Φ(x) this algorithm returns an integral basis fork[ x ]/ϕ(x)k[ x ] overk
This paper provides an overview on existing algorithms for factoring polynomials over global fields ...
This paper describes an algorithm for the factorization of multivariate polynomials with coefficient...
AbstractA new deterministic algorithm for factoring polynomials over finite fields is presented. Thi...
AbstractWe describe an efficient new algorithm for factoring a polynomial Φ(x) over a fieldkthat is ...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
AbstractWe exhibit a deterministic algorithm for factoring polynomials in one variable over finite f...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
Let f (x) be a separable polynomial over a local field. The Montes algorithm computes certain approx...
AbstractLet f(x) be a separable polynomial over a local field. The Montes algorithm computes certain...
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...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
AbstractIn this paper we describe software for an efficient factorization of polynomials over global...
Abstract. Let f(x) be a separable polynomial over a local field. Montes algorithm com-putes certain ...
This paper provides an overview on existing algorithms for factoring polynomials over global fields ...
This paper describes an algorithm for the factorization of multivariate polynomials with coefficient...
AbstractA new deterministic algorithm for factoring polynomials over finite fields is presented. Thi...
AbstractWe describe an efficient new algorithm for factoring a polynomial Φ(x) over a fieldkthat is ...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
AbstractWe exhibit a deterministic algorithm for factoring polynomials in one variable over finite f...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
Let f (x) be a separable polynomial over a local field. The Montes algorithm computes certain approx...
AbstractLet f(x) be a separable polynomial over a local field. The Montes algorithm computes certain...
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...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
AbstractIn this paper we describe software for an efficient factorization of polynomials over global...
Abstract. Let f(x) be a separable polynomial over a local field. Montes algorithm com-putes certain ...
This paper provides an overview on existing algorithms for factoring polynomials over global fields ...
This paper describes an algorithm for the factorization of multivariate polynomials with coefficient...
AbstractA new deterministic algorithm for factoring polynomials over finite fields is presented. Thi...
DOI
Add to ORKG