Randomized Algorithms (Spring 2010): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 55: | Line 55: | ||
= Syllabus = | = Syllabus = | ||
随机化（randomization）是现代计算机科学最重要的方法之一。 | |||
* [[Randomized Algorithms (Spring 2010)/Course materials|教材和参考书 Course materials]] | |||
= Assignments = | |||
= Lecture Notes = | = Lecture Notes = | ||
Revision as of 13:03, 26 December 2009
 Randomized Algorithms by Motwani and Raghavan | |
| Instructor | |
|---|---|
| 尹一通 | |
| yitong.yin@gmail.com yinyt@nju.edu.cn yinyt@lamda.nju.edu.cn | |
| office | 蒙民伟楼 406 |
| Class | |
| Class meetings | 8 am-10 am, Wednesday |
| Office hours | 2pm-5pm, Saturday, MMW 406 |
| Textbook | |
| Motwani and Raghavan, Randomized Algorithms. Cambridge Univ Press, 1995. | |
This is the homepage for Randomized Algorithms class for the Spring 2010 semester. Students who take this class should check this page periodically for content updates and new announcements.
Announcement
There is no announcement yet.
Syllabus
随机化（randomization）是现代计算机科学最重要的方法之一。