What efficient algorithms exist for the solving $x^N = a$ in GF(q)?
What are their complexities?