What exists efficient algorithms for the solution $x^N = a$ in GF(q)?
What is their complexity?