Tests for primality under the Riemann hypothesis

Authors:
Jacques Vélu
Affiliations:
Ecole Polytechnique, Centre de Mathèmatiques, Palaiseau, France
Venue:
ACM SIGACT News
Year:
1978

Citing 1
Cited 1

Riemann's Hypothesis and tests for primality

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Fast algorithms under the extended riemann hypothesis: A concrete estimate

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Assuming the extended Riemann hypothesis (ERH), G. Miller produced in a very interesting paper [1], an algorithm which tests primality and runs in O((log n)4+ε) steps. We provide a short proof of this result.