Main Page

Table of Contents

General Information

Undergraduate Studies

Graduate Studies

• Admissions
• Academic Regulation
• Student Finances
• General Academic Requirements
• Fields of Graduate Study:
  Academic Degrees & Course Listings
• Language Institutes
• Summer Session

Research

Continuing Education & Training Programs

Appendix: Personnel & Enrollment

Algorithms and Complexity Theory

Measures of the complexity of algorithms. Amortized complexity. Greedy algorithms. Dynamic programming. NP-Completeness and lower-bound theory. Cook's Theorem. Techniques for proving problems NP-complete. Complexity of parallel algorithms. Well-parallelizable and hardly-parallelizable problems.

3 cr.