CS4510 [at Georgia Tech]

Automata and Complexity, 3 credit hours — Computational machine models and their language classes. Undecidability. Resource-bounded computations. Central complexity-theoretic concepts such as complexity classes, reducibility and completeness.

Prereqs: All of:

Either of:
- CS3510
- CS3511
Either of:
- MATH3012
- MATH3022
One of:
- MATH3215
- MATH3235
- MATH3225
- [MATH3770 on OSCAR]
- MATH3670
- CEE3770
- ISYE3770
- All of:
  - ISYE2027
  - Either of:
    
    ISYE2028
    ISYE3030

Taught by:

Zvi Galil (from CIOS): 8 hours per week on average; 8.2 in Spring 2024; 8.2 in Fall 2023; 8 in Fall 2022.
Joseph Jaeger (from CIOS): 7.8 hours per week on average; 8.1 in Fall 2023; 7.7 in Fall 2022.

Main sections

CS4510A

Taught by Zvi Galil. CRN is 83503, [view on OSCAR].

Meetings

12:30PM-1:45PM in Howey Physics room L1 every Tuesday, Thursday

CS4510B

Taught by Joseph Jaeger. CRN is 87046, [view on OSCAR].

Meetings

3:30PM-4:45PM in Howey Physics room L2 every Tuesday, Thursday