Directory
General Information |
Schedule|
Assignments |
Solutions |
Handouts |
Final Exam |
Problem Sets|
Course Information
An introduction to NP-completeness and
intractability. Models of computation.
Lower bounding techniques. Advanced algorithms selected for their practical
and aesthetic interest. Prerequisites: 226 and 341.
Administrative Information
Lectures: TTh 10:30-11:50am , Room: TBA
Professor: Robert Tarjan -
324 CS Building - 258-4797
ret@cs.princeton.edu
Undergraduate Coordinator:
Tina McCoy -
tmhill@cs.princeton.edu
410 CS Building - 258-1746
Teaching Assistants:
Jessica Fong - room 413, 258-1797
jfong@cs.princeton.edu
Zhiyan Liu - room 217, 258-0451
zhiyan@cs.princeton.edu
