[Theory] UC Theory Seminar: a reminder

[Alexander Razborov]

Tuesday, April 12, 3:30pm
Location Kent 107

Will Perkins (UIC)

TITLE:  Sampling, counting, and local central limit theorems

ABSTRACT: I will describe how local central limit theorems (and 
Fourier-analytic proofs of local central limit theorems) can be used to 
design fast sampling algorithms and deterministic approximate counting 
algorithms for the number of independent sets and matchings of a given 
size in bounded degree graphs.

Joint work with Vishesh Jain, Ashwin Sah, and Mehtaab Sawhney.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: WperkinsFlier.docx
Type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
Size: 307298 bytes
Desc: not available
URL: <http://mailman.cs.uchicago.edu/pipermail/theory/attachments/20220411/a0bb6968/attachment-0001.docx>