User Tools
courses:theory2021:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2021:main [2021/04/13 20:23] tsay2 [Announcements] |
courses:theory2021:main [2021/11/09 09:37] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 07/01: grade report available; please send inquiries, if any, to the instructor by 5PM 07/02. | ||
| + | * 06/21: slides from TA sessions: {{courses:theory2021:hw6_10.pdf|HW#6-10}}. | ||
| + | * 06/21: notes/slides for More NP-Complete Problems available. | ||
| + | * 06/08: slides from TA sessions: {{courses:theory2021:hw6_9.pdf|HW#6-9}}. | ||
| + | * 06/02: {{courses:theory2021:hw10.pdf|HW#10}} due on 06/15. | ||
| + | * 05/24: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/24: {{courses:theory2021:hw9.pdf|HW#9}} due on 06/01. | ||
| + | * 05/18: notes/slides for Reducibility available. | ||
| + | * 05/11: {{courses:theory2021:hw8.pdf|HW#8}} due on 05/18. | ||
| + | * 05/11: {{courses:theory2021:theory2021mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/04: notes/slides for Decidability available. | ||
| + | * 05/04: {{courses:theory2021:hw7.pdf|HW#7}} due on 05/11. | ||
| + | * 04/27: notes/slides for Turing Machines available. | ||
| + | * 04/13: old exams: {{courses:theory:old_exams.zip|2000-2020}}. (Note: I didn't offer the course some of the years.) | ||
| * 04/13: slides from TA sessions: {{courses:theory2021:hw1_5.pdf|HW#1-5}}. | * 04/13: slides from TA sessions: {{courses:theory2021:hw1_5.pdf|HW#1-5}}. | ||
| * 04/12: {{courses:theory2021:hw6.pdf|HW#6}} due on 04/27. | * 04/12: {{courses:theory2021:hw6.pdf|HW#6}} due on 04/27. | ||
courses/theory2021/main.1618316593.txt.gz ยท Last modified: 2021/04/13 20:23 by tsay2
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
