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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.