A primality test is an algorithm used to determine if a number is prime. It is used in cryptography and is comparatively easy to run, with a polynomial running time. Primality tests can either prove that a number is prime or composite, with the latter being more accurately called compositeness tests.
Stanford University
Fall 2022
This course dives into the use of randomness in algorithms and data structures, emphasizing the theoretical foundations of probabilistic analysis. Topics range from tail bounds, Markov chains, to randomized algorithms. The concepts are applied to machine learning, networking, and systems. Prerequisites indicate intermediate-level understanding required.
No concepts data
+ 37 more concepts