CS 4814

CS 4814

Course information provided by the Courses of Study 2019-2020.

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 Spring.

Prerequisites/Corequisites Prerequisite: CS 4820.

View Enrollment Information

Enrollment Information
Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 18026CS 4814  LEC 001