The Power of Randomness in Computation
- 2005-07-25 (Mon.), 10:30 AM
- 二樓交誼廳
- 呂 及 人 教授
- 本院資訊所副研究員
Abstract
Randomness is a powerful resource in computation. As we will see, randomness can be used to save time, space, or communication, and provide new ways for doing mathematical proofs. However, randomized algorithms typically depend on the availability of a perfect random source, whose existence even in nature is debatable. We will see how to deal with this issue, using randomness extractors and pseudo-random generators.
最後更新日期: