There's no clear relationship between P vs. NP and the Riemann hypothesis, except that the generalized Riemann hypothesis (GRH) would let you derandomize certain randomized algorithms, and also Mulmuley's Geometric Complexity Theory (a speculative approach to P vs. NP using algebraic geometry and representation theory) involves some of the same mathematical objects that were used to prove the analogues of RH over finite fields.
