Computational machine models and their language classes. Undecidability. Resource-bounded computations. Central complexity-theoretic concepts such as complexity classes, reducibility and completeness.
Requisites
Prerequisites:
(CS 3510 (Min. Grade: C) or CS 3511 (Min. Grade: C)) and (MATH 3012 (Min. Grade: D) or MATH 3022 (Min. Grade: D)) and (MATH 3215 (Min. Grade: D) or MATH 3235 (Min. Grade: D) or MATH 3225 (Min. Grade: D) or MATH 3770 (Min. Grade: D) or MATH 3670 (Min. Grade: D) or CEE 3770 (Min. Grade: D) or ISYE 3770 (Min. Grade: D) or (ISYE 2027 (Min. Grade: D) and (ISYE 2028 (Min. Grade: D) or ISYE 3030 (Min. Grade: D))))
Restrictions:
Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * (A)
All Instructors
This total includes data from semesters with unknown instructors
Abrahim Ladha
8 terms from Summer 2021 to Summer 2025
Summer 2025
Spring 2025
Summer 2024
Spring 2024
Fall 2023
Summer 2023
Spring 2023
Summer 2021
Vijay Ganesh
2 terms from Spring 2025 to Summer 2025
Zvi Galil
9 terms from Fall 2020 to Spring 2025
Fall 2024
Fall 2022
Spring 2022
Fall 2021
Spring 2021
Fall 2020
Joseph Jaeger
3 terms from Fall 2022 to Fall 2024
Suguman Bansal
2 terms from Spring 2023 to Spring 2024
Frederic Faulkner
3 terms from Fall 2021 to Spring 2023
Merrick Furst
Hamid Reza Hassanzadeh
Summer 2020
Yang Peng
2 terms from Fall 2018 to Spring 2020
Spring 2020
Fall 2018
Santosh Vempala
Fall 2019
Kolomira-Elini Mihail
Spring 2019
H. Venkateswaran
2 terms from Fall 2017 to Spring 2018
Spring 2018
Fall 2017
Alexandra Boldyreva
2 terms from Fall 2016 to Fall 2017
Fall 2016
Richard Lipton
2 terms from Fall 2016 to Spring 2017
Spring 2017
Website Lead
Buzz Grades is maintained by Donghyun "Vince" Kim · Data: LITE (2016-2025), Course Catalog & OSCAR
Copyright
2025 Donghyun Kim, Buzz Grades
·