This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains.
This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains.
这课程研究如何用乱数并透过随意抽样、随机选择证物、破坏对称以及马可夫链使得演算法更简单和更有效率。