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
  • MATH3670
  • CEE3770
  • ISYE3770

  • All of:

    • ISYE2027

    • Either of:

      • ISYE2028
      • ISYE3030

Taught by:

Zvi Galil

Teacher information not finished yet!

Joseph Jaeger

Teacher information not finished yet!

Main sections