Tests for primality under the Riemann hypothesis
- 1 July 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 10 (2) , 58-59
- https://doi.org/10.1145/990524.990531
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.Keywords
This publication has 2 references indexed in Scilit:
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975