Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


An $ O(n\sp{1/10.89})$ primality testing algorithm

Authors: Leonard Adleman and Frank Thomson Leighton
Journal: Math. Comp. 36 (1981), 261-266
MSC: Primary 10A25; Secondary 10-04, 68C25
MathSciNet review: 595060
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper, we describe an $ O({n^{1/10.89}})$ deterministic algorithm to decide primality. The algorithm incorporates several recent results in complexity theory.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10A25, 10-04, 68C25

Retrieve articles in all journals with MSC: 10A25, 10-04, 68C25

Additional Information

PII: S 0025-5718(1981)0595060-8
Keywords: Algorithm, Carmichael number, composite, factor, prime, residue
Article copyright: © Copyright 1981 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia