BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Pinyan Lu (Shanghai University of Finance and Economics)
DTSTART:20201224T070000Z
DTEND:20201224T080000Z
DTSTAMP:20260423T021017Z
UID:SCMSComb/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/28/
 ">Classifying Computational Counting Problems</a>\nby Pinyan Lu (Shanghai 
 University of Finance and Economics) as part of SCMS Combinatorics Seminar
 \n\n\nAbstract\nAbstract: The main theme of theoretical computer science i
 s to classify various computational problems in terms of their inherent co
 mputational difficulty. In this talk\, I will try to demonstrate this gene
 ral theme by some cases study of my own research on the algorithms and com
 plexity for counting problems defined on graphs.\n\npw 030303\n
LOCATION:https://researchseminars.org/talk/SCMSComb/28/
END:VEVENT
END:VCALENDAR