Almost all primes can be quickly certified

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: S Goldwasser EECS Department and Laboratory for Computer Science, Massachusetts Institute of Technology
J Kilian Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology
Published in:
· Proceeding
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Pages 316-329
ACM New York, NY, USA ©1986
table of contents ISBN:0-89791-193-8 doi>10.1145/12130.12162
Almost all primes can be quickly certified Published by ACM 1986 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 36
· Downloads (cumulative): 625
· Citation Count: 29


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder