Detailed Course Information |
Spring 2020
Dec 23, 2024 |
|
 |
||
 | Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
| CS 4510 - Automata and Complexity |
|
Computational machine models and their language classes. Undecidability. Resource-bounded computations. Central complexity-theoretic concepts such as complexity classes, reducibility and completeness.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP All Sections for this Course Dept/Computer Science Department Course Attributes: Tech Elect CS, Engr, &Sciences, Theory (CS) Restrictions: Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * Prerequisites: (Undergraduate Semester level CS 3510 Minimum Grade of C or Undergraduate Semester level CS 3511 Minimum Grade of C) and (Undergraduate Semester level MATH 3012 Minimum Grade of D or Undergraduate Semester level MATH 3022 Minimum Grade of D) and (Undergraduate Semester level MATH 3215 Minimum Grade of D or Undergraduate Semester level MATH 3225 Minimum Grade of D or Undergraduate Semester level MATH 3770 Minimum Grade of D or Undergraduate Semester level MATH 3670 Minimum Grade of D or Undergraduate Semester level CEE 3770 Minimum Grade of D or Undergraduate Semester level ISYE 3770 Minimum Grade of D or (Undergraduate Semester level ISYE 2027 Minimum Grade of D and Undergraduate Semester level ISYE 2028 Minimum Grade of D) ) |
| Return to Previous | New Search |
|