User Tools
courses:theory2022:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2022:main [2022/04/26 16:26] tsay2 [Announcements] |
courses:theory2022:main [2022/06/06 11:47] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| - | * 04/26: {{courses:theory2022:hw7.pdf|HW#7}} due on * 04/26: notes/slides for Decidability available. | + | * 06/06: slides from TA sessions: {{courses:theory2022:hw_1-5.pdf|HW#1-5}}, {{courses:theory2022:hw_6-10.pdf|HW#6-10}}. |
| + | * 05/31: notes/slides for More NP-Complete Problems available. | ||
| + | * 05/24: {{courses:theory2022:hw10.pdf|HW#10}} due 1:20PM 05/31. | ||
| + | * 05/17: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/17: {{courses:theory2022:hw9.pdf|HW#9}} due on 05/24. | ||
| + | * 05/17: notes/slides for Reducibility available. | ||
| + | * 05/01: {{courses:theory2022:hw8.pdf|HW#8}} due on 05/10. | ||
| + | * 04/26: {{courses:theory2022:hw7.pdf|HW#7}} due on 05/03. | ||
| + | * 04/26: notes/slides for Decidability available. | ||
| * 04/26: {{courses:theory2022:theory2022mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | * 04/26: {{courses:theory2022:theory2022mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| * 04/18: notes/slides for Turing Machines available. | * 04/18: notes/slides for Turing Machines available. | ||
courses/theory2022/main.1650961564.txt.gz · Last modified: 2022/04/26 16:26 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
