CS 4814

Last Updated

  • Schedule of Classes - January 19, 2016 6:14PM EST
  • Course Catalog - January 19, 2016 6:21PM EST

CS 4814
Introduction to Computational Complexity

Course information provided by the 2015-2016 Catalog.

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.


Prerequisites/Corequisites Prerequisite: CS 4820.

When Offered Fall.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 17415 CS 4814   LEC 001

  •  

  • Instruction Mode: In Person