Almost All Primes Can Be Quickly Certified

Shafi Goldwasser, Joe Kilian. Almost All Primes Can Be Quickly Certified. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA. pages 316-329, ACM, 1986.

Authors

Shafi Goldwasser

This author has not been identified. Look up 'Shafi Goldwasser' in Google

Joe Kilian

This author has not been identified. Look up 'Joe Kilian' in Google