CS 6820

Last Updated

  • Schedule of Classes - July 10, 2025 1:15PM EDT
  • Course Catalog - June 9, 2016 6:15PM EDT

CS 6820
Analysis of Algorithms

Course information provided by the 2015-2016 Catalog.

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.


Prerequisites/Corequisites Prerequisite: CS 4820 or graduate standing.

When Offered Fall.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 12954 CS 6820   LEC 001

  •  

  • Instruction Mode: In Person