On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment