The purpose of this paper is to present new upper bounds on the complexity of algorithms for testing the primality of a number. The first upper bound is 0(n1/7); it improves the previously best known bound of 0(n1/4) due to Pollard [11].
No takes yet. Share an insight, caveat, or question.
Gary L. Miller (1975) studied this question.