Searching. Please wait…
1582
37
171
29406
4423
2606
347
392
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.
Fuente: Journal of Symbolic Computation, 2020, 99, 231-241
Publisher: Elsevier
Year of publication: 2020
No. of pages: 11
Publication type: Article
DOI: 10.1016/j.jsc.2019.06.001
ISSN: 0747-7171,1095-855X
Spanish project: MTM2014-55421-P
Publication Url: https://doi.org/10.1016/j.jsc.2019.06.001
SCOPUS
Citations
Google Scholar
Metrics
Read publication
DOMINGO GOMEZ PEREZ
MÉRAI, LÁSZLÓ
SHPARLINSKI, IGOR E.
Back
