On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

06/14/2017

∙

by   Domingo Gómez-Pérez, et al.

∙

0

∙

share

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.