Algorithms Approaching the Threshold for Semi-random Planted Clique-Reference-Cited by-同舟云学术

Algorithms Approaching the Threshold for Semi-random Planted Clique

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Buhai Rares-Darius¹,Kothari Pravesh K.²,Steurer David¹

Affiliation:

1. ETH Zurich, Switzerland

2. Carnegie Mellon University, USA

Funder

ERC

NSF CAREER Award

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3564246.3585184

Reference53 articles.

1. Subexponential Algorithms for Unique Games and Related Problems

2. Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures

3. Ainesh Bakshi , Ilias Diakonikolas , He Jia , Daniel M. Kane , Pravesh K. Kothari , and Santosh S . Vempala . 2020 . Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR , abs/2012.02119 (2020), arXiv:2012.02119. arxiv:2012.02119 Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, and Santosh S. Vempala. 2020. Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR, abs/2012.02119 (2020), arXiv:2012.02119. arxiv:2012.02119

4. Ainesh Bakshi and Pravesh Kothari . 2020. Outlier-Robust Clustering of Non-Spherical Mixtures. CoRR, abs/2005.02970 ( 2020 ), arXiv:2005.02970. arxiv:2005.02970 Ainesh Bakshi and Pravesh Kothari. 2020. Outlier-Robust Clustering of Non-Spherical Mixtures. CoRR, abs/2005.02970 (2020), arXiv:2005.02970. arxiv:2005.02970

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust Recovery for Stochastic Block Models, Simplified and Generalized;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Planted Clique Conjectures Are Equivalent;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Private Graphon Estimation via Sum-of-Squares;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06