Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
What exists efficient algorithms exist for the solutionsolving $x^N = a$ in GF(q)? What isare their complexitycomplexities?
What exists efficient algorithms for the solution $x^N = a$ in GF(q)? What is their complexity?
What efficient algorithms exist for the solving $x^N = a$ in GF(q)? What are their complexities?
