CMPS290A: Topics in Algorithms and Complexity Theory: Probabilistic Algorithms and Average Case Analysis

Graduate seminar in algorithms and complexity theory on topics from recently published research journal articles and conference proceedings. Topics vary from year to year depending on the current research of the instructor(s) and interests of students. Students read technical papers from relevant journals and conference proceedings and present class lectures. Guest lectures may supplement the student presentations. A research project and/or paper may be required. Enrollment restricted to graduate students.

5 credits

Year	Fall	Winter	Spring	Summer

Comments

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.