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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.