[comp.theory] Primality Testing

kumar@wucs1.wustl.edu (Arun Kumar) (03/01/90)

In article <1990Feb26.183024.23868@sj.ate.slb.com> basie@sj.ate.slb.com writes:
>	Given a positive integer x,
>	Is x a prime number?
>
>My question is this: What is the fastest algorthm for
>determining the primality of x and what is its time

Look for a paper by Rabin in the Computer and Control Abstracts around
1984. He describes a fast probabilistic algorithm.
--------------------------------------------------------------
Arun Kumar (kumar@wucs1.wustl.edu)