| Previous Month | Back to 6.046 Homepage |
| May 2001 | ||||||
|---|---|---|---|---|---|---|
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
1L19 Computational Geometry I. |
2 |
3L20 Computational Geometry II.PS6 out. |
4R10 Computational geometry examples. |
5 |
||
6 |
7 |
8L21 Complexity: P vs. NP, efficient verification.Reading: Sections 36.1-2. |
9 |
10L22 NP-completeness.Reading: Sections 36.3-5. PS6 due. |
11R11 NP-completeness.Reading: Chapter 36. |
12 |
13 |
14 |
15L23 Approximation algorithms: vertex cover, traveling salesman problem, partition.Reading: Chapter 37. |
16 |
17L24 Advanced topics. |
18 |
19 |
20 |
21 |
22 |
23 |
24 |
25 |
26 |
27 |
28 |
29 |
30 |
31 |
||