University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > The complexity of counting problems

The complexity of counting problems

Add to your list(s) Download to your calendar using vCal

  • UserDavid Richerby, University of Essex
  • ClockFriday 29 April 2022, 14:00-15:00
  • HouseSS03.

If you have a question about this talk, please contact Jamie Vicary.

Every computational decision problem (“Is there an X?”) has a natural counting variant (“How many X’s are there?”). More generally, computing weighted sums such as integrals, expectations and partition functions in statistical physics can also be seen as counting problems.

I will give an introduction to the complexity of solving counting problems. I will focus on variants of constraint satisfaction problems (CSPs) and exactly 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 to be classified completely and elegantly.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity