User Tools
courses:theory2020:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2020:main [2020/05/19 16:31] tsay2 [Syllabus/Schedule (with links to notes/slides)] |
courses:theory2020:main [2020/07/26 11:37] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 07/03: grade report available; please send inquiries, if any, to the instructor by 5PM 07/04. | ||
| + | * 06/23: slides for Minimization of DFAs available. | ||
| + | * 06/23: notes/slides for More NP-Complete Problems available. | ||
| + | * 06/16: slides from TA sessions updated again. | ||
| + | * 06/13: slides from TA sessions updated. | ||
| + | * 06/12: slides from TA sessions: {{courses:theory2020:hw6_10.pdf|HW#6-10}}. | ||
| + | * 06/03: electronic submission of {{courses:theory2020:hw10.pdf|HW#10}} changed to hardcopy submission. | ||
| + | * 06/02: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 06/02: {{courses:theory2020:hw10.pdf|HW#10}} due on 06/09. | ||
| + | * 06/01: we will meet in the classroom from 06/02. | ||
| + | * 05/25: {{courses:theory2020:theory2020mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/21: due date of HW#9 extended to 06/02. | ||
| * 05/19: {{courses:theory2020:hw9.pdf|HW#9}} due on 05/26. | * 05/19: {{courses:theory2020:hw9.pdf|HW#9}} due on 05/26. | ||
| * 05/19: notes/slides for Reducibility available. | * 05/19: notes/slides for Reducibility available. | ||
| Line 60: | Line 72: | ||
| *Decidability (and Undecidability) (1.5 weeks: 5/12, 5/19a*) [{{courses:theory2020:ch4_notes.pdf|notes}}, {{courses:theory2020:ch4_slides.pdf|slides}}] | *Decidability (and Undecidability) (1.5 weeks: 5/12, 5/19a*) [{{courses:theory2020:ch4_notes.pdf|notes}}, {{courses:theory2020:ch4_slides.pdf|slides}}] | ||
| *Reducibility (1.5 weeks: 5/19b, 5/26) [{{courses:theory2020:ch5_notes.pdf|notes}}, {{courses:theory2020:ch5_slides.pdf|slides}}] | *Reducibility (1.5 weeks: 5/19b, 5/26) [{{courses:theory2020:ch5_notes.pdf|notes}}, {{courses:theory2020:ch5_slides.pdf|slides}}] | ||
| - | *Time Complexity and NP-Completeness (2 weeks: 6/2, 6/9*) [{{courses:theory2020:ch7_notes_a.pdf|notes}}, {{courses:theory2020:ch7_slides_a.pdf|slides}}] | + | *Time Complexity and NP-Completeness (2 weeks: 6/2, 6/9*) [{{courses:theory2020:ch7a_notes.pdf|notes}}, {{courses:theory2020:ch7a_slides.pdf|slides}}] |
| * **Final** (**2020/06/16**) | * **Final** (**2020/06/16**) | ||
| - | *More about NP-Completeness and Related Topics (2 weeks: 6/23, 6/30) [{{courses:theory2020:ch7_notes_b.pdf|notes}}, {{courses:theory2020:ch7_slides_b.pdf|slides}}] | + | *More about NP-Completeness (1 week: 6/23) [{{courses:theory2020:ch7b_notes.pdf|notes}}, {{courses:theory2020:ch7b_slides.pdf|slides}}] |
| + | *Wrap-Up Discussions (1 week: 6/30) | ||
| =====References===== | =====References===== | ||
| *MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045j-automata-computability-and-complexity-spring-2011/index.htm|Automata, Computability, and Complexity]] | *MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045j-automata-computability-and-complexity-spring-2011/index.htm|Automata, Computability, and Complexity]] | ||
courses/theory2020/main.1589877102.txt.gz · Last modified: 2020/05/19 16:31 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
