Información de la publicación

Detalle_Publicacion

On the complexity of exact counting of dynamically irreducible polynomials

Abstract: We give an efficient algorithm to enumerate all sets of r>=1 quadratic polynomials over a finite field which remain irreducible under iterations and compositions.

Other publications of the same journal or congress with authors from the University of Cantabria

Computing hypercircles by moving hyperplanes - Article
Algorithms for Del Pezzo surfaces of degree 5 (construction, parametrization) - Article
Optimal affine reparametrization of rational curves - Article
Computing automorphisms of semigroups - Article
Quotients of Gaussian graphs and their application to perfect codes - Article
Common composites of triangular polynomial systems and hash functions - Article
On tubular vs. swung surfaces - Article
Construction algorithms for rational cubic surfaces - Article
Reasoning about linkages with dynamic geometry - Article
Mathematical and computer algebra techniques in cryptology - Article
Special issue on dynamic geometry and automated reasoning - Article
Recovering a sum of two squares decomposition - Article
On some classes of irreducible polynomials - Article
On Bézout inequalities for non-homogeneous polynomial ideals - Article

Fuente: Journal of Symbolic Computation 99 (2020), p. 231-241

Publisher: Elsevier

Year of publication: 2020

No. of pages: 11

Publication type: Article

ISSN: 0747-7171,1095-855X

Spanish project: MTM2014-55421-P

Publication Url: https://doi.org/10.1016/j.jsc.2019.06.001

Authorship

DOMINGO GOMEZ PEREZ

MÉRAI, LÁSZLÓ

SHPARLINSKI, IGOR E.

Download reference

Bib Ris

Back

Researchers portal

Portal del personal investigador

Detalle_Publicacion

On the complexity of exact counting of dynamically irreducible polynomials

Authorship

Download reference