CS 4814

Last Updated

  • Schedule of Classes - June 25, 2020 7:14PM EDT
  • Course Catalog - June 25, 2020 7:15PM EDT

CS 4814
Introduction to Computational Complexity

Course information provided by the 2019-2020 Catalog.

Explores the power and limitations of efficient computation. Understanding how the notion of efficient computation changes with respect to resources such as time, space, randomness, advice, and interaction. Concrete computational models that we will study will include Turing machines, Boolean circuits, Decision trees, and Branching Programs. Advanced topics may include error-correcting codes, probabilistic checkable proofs, and circuit lower bounds.


Prerequisites/Corequisites Prerequisite: CS 4820.

When Offered Spring.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 18026 CS 4814   LEC 001

  •  

  • Instruction Mode: Hybrid - Online & In Person