Factorization of various types of polynomials over a finite field Fq is a classical problem. However factorization of permutation polynomials of Fq was not studied previously. Here we present results on the degrees of the irreducible factors of a large class of permutation polynomials
A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(q)(x),...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
Factorization of various types of polynomials over a finite field Fq is a classical problem. Howeve...
We discuss a special class of permutation polynomials over finite fields focusing on some recent wor...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
We study the factorization of polynomials of the form F(r)(X) = bx(qr+1) - ax(qr) + dx - c over the ...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
AbstractMotivated by several constructions of permutation polynomials done by several authors (most ...
Motivated by several constructions of permutation polynomials done by several authors (most notably ...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
We study degree preserving maps over the set of irreducible polynomials over a finite field. In part...
AbstractVarious results on the parity of the number of irreducible factors of given polynomials over...
We consider the largest degrees that occur in the decomposition of polynomials over finite fields in...
Permutation polynomials are an interesting subject of mathematics and have applications in other are...
A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(q)(x),...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
Factorization of various types of polynomials over a finite field Fq is a classical problem. Howeve...
We discuss a special class of permutation polynomials over finite fields focusing on some recent wor...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
We study the factorization of polynomials of the form F(r)(X) = bx(qr+1) - ax(qr) + dx - c over the ...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
AbstractMotivated by several constructions of permutation polynomials done by several authors (most ...
Motivated by several constructions of permutation polynomials done by several authors (most notably ...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
We study degree preserving maps over the set of irreducible polynomials over a finite field. In part...
AbstractVarious results on the parity of the number of irreducible factors of given polynomials over...
We consider the largest degrees that occur in the decomposition of polynomials over finite fields in...
Permutation polynomials are an interesting subject of mathematics and have applications in other are...
A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(q)(x),...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
DOI
Add to ORKG