Next:
5.1 A Monte-Carlo Primality
Up:
Fundamentals of Computing
Previous:
4.3 An NP-Complete Problem:
5 Randomness in Computing.
5.1 A Monte-Carlo Primality Tester.
5.2 Randomized Algorithms and Random Inputs.
5.3 Randomness and Complexity.
5.4 Pseudo-randomness.
5.5 Cryptography.
Leonid Levin
Wed Aug 21 20:35:42 EDT 1996
