COM S 681: Analysis of Algorithms

Cross-Listing: Not cross-listed.

Methodology for developing efficient algorithms, primarily for graph theoretic problems. Understanding of the inherent complexity of natural problems via polynomial-time algorithms, randomized algorithms, NP-completeness, randomized reducibilities. Additional topics such as parallel algorithms and efficient data structures.

Offered: Fall only

Prerequisites: COM S482 or graduate standing.

Grade options: Letter or S/U

Credit hours: 4

Recent offerings:

• http://www.cs.cornell.edu/courses/cs681/2006fa
  • Eva Tardos
• http://www.cs.cornell.edu/courses/cs681/2005fa
  • Dexter Kozen
• http://www.cs.cornell.edu/courses/cs681/2004fa
  • Dexter Kozen