Analysis of Algorithms
Cornell University, Fall 2013
Instructor: |
Bobby Kleinberg rdk@cs. 4138 Upson Office hours: Weds. 3:45-4:45, Thurs. 1-2 Phone: 255-9200 |
TA: | Chen Wang
chenwang@cs.cornell.edu Office hours: TBA |
The official prerequisites for the course are CS 4820 or graduate standing. We will assume knowledge of:
Course Description (from the 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.