Lecturers and Teaching Assistants
Prof. Uriel Feige
Course Schedule and Location
Thursday, 14:00 - 15:45, Ziskind, Rm 1
Field of Study, Course Type and Credit Points
Mathematics and Computer Science: Lecture; Elective; 2.00 points
Mathematics and Computer Science (Systems Biology / Bioinformatics): 2.00 points
basic undergraduate knowledge in algorithms and computational complexity.
Attendance and participation
Scheduled date 1
Estimated Weekly Independent Workload (in hours)
Ranges from basic algorithmic techniques such dynamic programming and greedy algorithms to more advanced topics such as treewidth and graph minors, algorithmic version of the local lemma, linear algebra techniques.
Upon successful completion of this course students should be able to:
 Gain familiarity with a host of algorithmic techniques and with methods for analyzing them,.
 Develop an understanding of which problems can be computed efficiently (and how) and which problems are beyond the scope of current techniques.
There will be lecture notes for the course on my home page