Showing papers on "Las Vegas algorithm published in 1985"
15 Jul 1985
TL;DR: Some deterministic and Las Vegas primality tests are presented and there is a polynomial time Las Vegas algorithm deciding primality of n, when n hat at most 2 prime factors and n mod 24.
Abstract: Some deterministic and Las Vegas primality tests are presented. Under certain conditions, they run in polynomial time. In particular, there is a polynomial time Las Vegas algorithm deciding primality of n, when n hat at most 2 prime factors and n \(\mathop \mp \limits^ + \)1 mod 24.
8 citations