Differences

This shows you the differences between two versions of the page.

--- courses:theory2022:main [2022/03/21 22:24]
tsay2 [Announcements]
+++ courses:theory2022:main [2022/06/06 11:47] (current)
tsay2 [Announcements]
@@ Line 3: / Line 3: @@
 =====Announcements=====
+  * 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/18: notes/slides for Turing Machines available.
+  * 04/09: old exams: {{courses:theory:old_exams.zip|2000-2021}}. (Note: I didn't offer the course some of the years.)
+  * 04/08: Problem 4 of HW#5 revised.
+  * 03/22: {{courses:theory2022:hw6.pdf|HW#6}} due on 04/19.
+  * 03/22: {{courses:theory2022:hw5.pdf|HW#5}} due on 04/12 (as 04/05 is a holiday).
   * 03/15: {{courses:theory2022:hw4.pdf|HW#4}} due 1:20PM 03/29.
   * 03/15: notes/slides for Context-Free Languages and Pushdown Automata available.

Yih-Kuen Tsay's Wiki @ IM.NTU