The Lecturer will describe some fascinating topics from the subject area called Theoretical Computer Science (TCS). TCS is the study of efficient algorithms and the mathematical structures surrounding the existence of such algorithms. TCS is a vast area, and due to the available time The Lecturer will only be able to give a select sample of many beautiful results. But hope that this sample will give students a taste of TCS, its intellectual vigor and its mathematical depth.
2016-07-04 ~ 2016-07-07 8:00-9:40, 15:25-17:05
Room112, 4th Teaching Building, Shanghai University of Finance & Economics
Application and RegistrationNo registration fee.
Lecture I. Efficient Algorithms.
Lecture II. P vs. NP
Lecture III. Classification Theorems in Counting Complexity.
Lecture IV. Graph Isomorphism.
Directions to ITCS