(\log n)^0n^0)$.  0.  the roots in ${\mathbb{F}}_{q^n}$ of irreducible polynomials of degree $n$ over ${\mathbb{F}}_q$ in preprocessing time $O((\log n)^0(\log\log n)^0 n^0+(\log q)(\log n)^{0+\epsilon}n)$ and delay time $O(