| Homework problems |
Reading assignments, part 2 |
MCS-265 homepage |
| Homework guidelines | Course Summary | Prof. Barbara Kaiser |
Reading
assignments, April 3 - May 16
| Date: |
Section: | Topic:
|
Due: |
| Feb. 6 -
March 24 Assignments |
|
|
|
| April 3 |
4.1 |
Decidable Langauges |
|
| April 4 |
|
Problem day | |
| April 6 |
4.2 | Halting problem | |
| April 7 |
|
cont. | |
| |
|
|
|
| April 10 |
5.1 | Undecidable problems | Hw 6 (4.1, 4.2) |
| April 11 |
|
Problem day | |
| April 13 |
Undecidable problems | |
|
| April 14 |
|
Easter break |
|
| |
|
|
|
| April 17 |
|
Easter break | |
| April 18 |
5.2 | Post correspondence problem |
|
| April 20 | cont. |
Hw 7 (5.1) | |
| April 21 |
5.3 | Mapping reducibility | |
| |
|
|
|
| April 24 |
|
cont. | |
| April 25 |
Review/catch-up | Hw 8 (5.2, 5.3) | |
| April 26 |
Test #2 | |
|
| April 27 |
7.1 | Complexity theory |
|
| |
|
|
|
| May 1 |
7.1, 7.2 | cont. | |
| May 2 |
7.2 | The class P | |
| May 4 |
7.2/7.3 | The class NP | |
| May 5 |
|
k-cliques, 3-cliques | |
| |
|
|
|
| May 8 |
7.4 | NP-completeness, satisfiablility | Hw 9 |
| May 9 |
Polynomial time reducibility,
Cook-Levin theorem |
|
|
| May 11 |
7.5 |
More NP-complete problems |
|
| May 12 |
|
Problem day |
|
| |
|
|
|
| May 15 |
|
Problem day | Hw 10 |
| May 16 |
|
Review |
Summary
due |