CS 4814

Course information provided by the Courses of Study 2015-2016.

Explores the power and limitations of efficient algorithms. Compares basic models of computations such as finite automata, Boolean circuits, and Turing machines. Illustrates the notion of computational intractability through the concept NP-completeness and the computational foundations of modern cryptography. Investigates the role of randomness and approximation in the modern theory of computing.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 4820.

View Enrollment Information

Enrollment Information
Syllabi: none
  •  

  • 3 Credits Stdnt Opt

  • 17415CS 4814  LEC 001

  •