# What is the complexity of computation of zero point by Rieman zeta function?

What is the complexity of computation of zero point by Rieman zeta function? That is, given s, whether ζ(s)=0? Is it in P? Any reference is appreciated.

• It may be me but I fail to clearly understand your question. Before talking about complexity, it should be clear what the input is. Do you want to check, given $s$, whether $\zeta(s)=0$? Do you want to enumerate them? Or something else? – holf Jul 4 '17 at 13:58
• @holf given s, whether ζ(s)=0? Thank you for your comment. – XL _At_Here_There Jul 4 '17 at 17:02
• How is $s$ given? Potential zeroes of $\zeta$ are complex numbers, not finite objects. – Emil Jeřábek Jul 4 '17 at 18:22
• @EmilJeřábek any good finite represent is ok, for instance, a program that outputs the number. Obviously, the program is finite that is with finite length. Thank you Emil, We usually meet on my question. – XL _At_Here_There Jul 4 '17 at 18:41