What is the run time for the most efficient algorithms for $p_n$ and $pi(n)$

24 Views Asked by At

Really a 2 part question: What is the fastest way to find the nth prime and the inverse function $pi(n)$? And secondly what is the run-time of the algorithms?