Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Approximate Counting and Sampling via Local Central Limit Theorems

Approximate Counting and Sampling via Local Central Limit Theorems

Thumbnail Image
Download
Name

3519935.3519957.pdf

Size

910.64 KB

Format

Adobe PDF

Checksum (MD5)

27e98530f0403278ecde0360f852c100

Download all files submitted through automated deposit
3519935.3519957.zip (834.69 KB)
Author(s)
Jain, Vishesh
•
Perkins, Will
•
Sah, Ashwin
•
Sawhney, Mehtaab
Date Issued
June 9, 2022
Publisher
ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Citation
Jain, Vishesh, Perkins, Will, Sah, Ashwin and Sawhney, Mehtaab. 2022. "Approximate Counting and Sampling via Local Central Limit Theorems."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/146422
DOI of Published Version
https://doi.org/10.1145/3519935.3519957
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.