Fast Evaluation of $\zeta(3)$

We prove that the complexity of evaluating $\zeta(3)$ with precision $2^{-n}$ is $0(n\log^3n\log\ log n)$ elementary operations, $\zeta(s)$ being a Riemann zeta function.