The Complexity of Goldbach's Conjecture and Riemann's Hypothesis

Elena Calude · ResearchSpace (University of Auckland) · 2009

In this paper we obtain better upper bounds on the complexities of Goldbach’s Conjecture and Riemann’s Hypothesis in [3] and [8] by improving the register machine language used as well as the optimisation technique.

Read the paper · More papers on PaperTik