CS 4814

Last Updated

  • Schedule of Classes - November 19, 2024 7:51PM EST
  • Course Catalog - November 19, 2024 7:07PM EST

CS 4814
Introduction to Computational Complexity

Course information provided by the Courses of Study 2024-2025.

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.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 4820.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session.  Combined with: CS 5814

  • 3 Credits Stdnt Opt

  • 19635 CS 4814   LEC 001

  •  

  • Instruction Mode: In Person