Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Clustering Mixtures with Almost Optimal Separation in Polynomial Time

Clustering Mixtures with Almost Optimal Separation in Polynomial Time

Thumbnail Image
Download
Name

3519935.3520012.pdf

Size

305.19 KB

Format

Adobe PDF

Checksum (MD5)

b6e20874c2b928b76af887db0522b94f

Download all files submitted through automated deposit
3519935.3520012.zip (257.67 KB)
Author(s)
Liu, Allen
•
Li, Jerry
Date Issued
June 9, 2022
Publisher
ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Citation
Liu, Allen and Li, Jerry. 2022. "Clustering Mixtures with Almost Optimal Separation in Polynomial Time."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/146433
DOI of Published Version
https://doi.org/10.1145/3519935.3520012
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.