Randomized algorithms are used in many areas, including algorithms for quick sort, primality testing and cryptography. Randomized algorithms are algorithms that use randomness as part of their logic or procedure. They can either always terminate with the correct answer (Las Vegas algorithms) or have a chance of producing an incorrect result (Monte Carlo algorithms). Randomized algorithms are used in many areas, such as sorting, primality testing, and cryptography.
UC Berkeley
Fall 2013
This course investigates the mathematical principles behind data and information analysis. It brings together concepts from statistics, optimization, and computer science, with a focus on large deviation inequalities, and convex analysis. It's tailored towards advanced graduate students who wish to incorporate these theories into their research.
No concepts data
+ 20 more concepts