1.Previous
3.Next

a probabilistic algorithm for testing whether a given number n is prime or composite. If n is composite, the test will detect n as composite WHP. There is a small chance that we are unlucky and the test will think that n is prime. But, the probability of error can be reduced indefinitely by running the test many times with different randomizations.
* Freivalds' algorithm: a randomized algorithm for verifying matrix multiplication. It runs faster than deterministic algorithms WHP.
* Treap:

1.Previous
3.Next