Time complexity to solve Discrete log problem
These days the fastest general method to solve discrete logarithms modulo primes is the number field sieve, which has the asymptotic complexity 

$$
e^{(1.92+o(1)) (\log p)^{1/3} (\log\log p)^{2/3}}
$$