CS 6820

CS 6820

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

Methodology for developing and analyzing efficient algorithms. Understanding the inherent complexity of natural problems via polynomial-time algorithms, advanced data structures, randomized algorithms, approximation algorithms, and NP-completeness. Additional topics may include algebraic and number theoretic algorithms, circuit lower bounds, online algorithms, or algorithmic game theory.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 4820 or graduate standing.

View Enrollment Information

Enrollment Information
Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 12954CS 6820  LEC 001