Primality testing revisited

@inproceedings{Davenport1992PrimalityTR,
  title={Primality testing revisited},
  author={J. Davenport},
  booktitle={ISSAC '92},
  year={1992}
}
  • J. Davenport
  • Published in ISSAC '92 1992
  • Computer Science
  • Rabin’s algorithm is commonly used in computer algebra systems and elsewhere for primality testing. This paper presents an experience with this in the Axiom* computer algebra system. As a result of this experience, we suggest certain strengthenings of the algorithm. 

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Modifications 18459366157::I, 21276028621::I ]::(List I) O(log4N) Modifications
    • 1980
    Pinch 1993] and Jaeschke 1993] Modiications The following global declarations are made
    • 1980