These include the Miller–Rabin primality test, which is fast but has a small probability of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical.
What is the name of another algorithm useful for conveniently testing the primality of large numbers? 
the AKS primality test