BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The complexity of counting problems - David Richerby\, University 
 of Essex
DTSTART:20220429T130000Z
DTEND:20220429T140000Z
UID:TALK173453@talks.cam.ac.uk
CONTACT:Jamie Vicary
DESCRIPTION:Every computational decision problem ("Is there an X?") has a 
 natural counting variant ("How many X's are there?"). More generally\, com
 puting weighted sums such as integrals\, expectations and partition functi
 ons in statistical physics can also be seen as counting problems.\n\nI wil
 l give an introduction to the complexity of solving counting problems. I w
 ill focus on variants of constraint satisfaction problems (CSPs) and exact
 ly counting the solutions\, though I'll also touch on approximate counting
 . CSPs are powerful enough to naturally express many important problems\, 
 but also being restricted enough to allow their computational complexity t
 o be classified completely and elegantly.
LOCATION:SS03
END:VEVENT
END:VCALENDAR