Logo

Classifying Computational Counting Problems

Speaker

Pinyan Lu, INS, Shanghai Jiao Tong University

Time

2012.02.29 14:00-15:00

Venue

520 Pao Yue-Kong Library

Abstract

The main theme of theoretical computer science is to classify various computational problems in terms of their inherent computational difficulty. In this talk, I will try to demonstrate this general theme by some cases study of my own research on the algorithms and complexity for counting problems.