Show simple item record

dc.contributor.authorJain, Vishesh
dc.contributor.authorPerkins, Will
dc.contributor.authorSah, Ashwin
dc.contributor.authorSawhney, Mehtaab
dc.date.accessioned2022-11-15T13:30:39Z
dc.date.available2022-11-15T13:30:39Z
dc.date.issued2022-06-09
dc.identifier.isbn978-1-4503-9264-8
dc.identifier.urihttps://hdl.handle.net/1721.1/146422
dc.publisherACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3519935.3519957en_US
dc.rightsArticle 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.en_US
dc.sourceACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.titleApproximate Counting and Sampling via Local Central Limit Theoremsen_US
dc.typeArticleen_US
dc.identifier.citationJain, Vishesh, Perkins, Will, Sah, Ashwin and Sawhney, Mehtaab. 2022. "Approximate Counting and Sampling via Local Central Limit Theorems."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-11-03T12:10:36Z
dc.language.rfc3066en
dc.rights.holderACM
dspace.date.submission2022-11-03T12:10:37Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record