Publication date
November 2019
DOI Publisher
American Mathematical Society (AMS) Journal
1098-3627Abstract
National Science Foundation (Grant DMS-1601946)Simons Foundation (Grants 402472, 550033
National Science Foundation (Grant DMS-1601946)Simons Foundation (Grants 402472, 550033
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
AbstractWe give new descriptions of the factors of Dickson polynomials over finite fields
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
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...
Thesis (Ph. D.)--University of Rochester. Dept. of Mathematics, 2016.Zeta functions of varieties ove...
This survey reviews several algorithms for the factorization of univariate polynomials over finite f...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Do...
A unified treatment of parameters relevant to factoring polynomials over finite fields is given. The...
AbstractLet r be a power of a prime number p, Fr be the finite field of r elements, and Fr[T] be the...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
AbstractWe give new descriptions of the factors of Dickson polynomials over finite fields
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
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...
Thesis (Ph. D.)--University of Rochester. Dept. of Mathematics, 2016.Zeta functions of varieties ove...
This survey reviews several algorithms for the factorization of univariate polynomials over finite f...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Do...
A unified treatment of parameters relevant to factoring polynomials over finite fields is given. The...
AbstractLet r be a power of a prime number p, Fr be the finite field of r elements, and Fr[T] be the...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
Osnovni izrek algebre pove, da lahko vsak nekonstanten polinom s koeficienti iz polja kompleksnih št...
AbstractWe give new descriptions of the factors of Dickson polynomials over finite fields
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the...
Add to ORKG