On the Complexity of Exact Counting of Dynamically Irreducible Polynomials
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.
READ FULL TEXT