Sum-of-Squares Lower Bounds for Densest k-Subgraph-Reference-Cited by-同舟云学术

Sum-of-Squares Lower Bounds for Densest k-Subgraph

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:

Jones Chris¹,Potechin Aaron²,Rajendran Goutham³,Xu Jeff³

Affiliation:

1. Bocconi University, Italy

2. University of Chicago, USA

3. Carnegie Mellon University, USA

Funder

National Science Foundation

European Research Council

Publisher

ACM

Link

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

Reference112 articles.

1. Kwangjun Ahn , Dhruv Medarametla , and Aaron Potechin . 2020 . Graph Matrices: Norm Bounds and Applications. arXiv preprint arXiv:1604.03423. Kwangjun Ahn, Dhruv Medarametla, and Aaron Potechin. 2020. Graph Matrices: Norm Bounds and Applications. arXiv preprint arXiv:1604.03423.

2. Vedat Levi Alev , Fernando Granha Jeronimo, and Madhur Tulsiani . 2019 . Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. Manuscript Vedat Levi Alev, Fernando Granha Jeronimo, and Madhur Tulsiani. 2019. Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. Manuscript

3. Noga Alon , Sanjeev Arora , Rajsekar Manokaran , Dana Moshkovitz , and Omri Weinstein . 2011. Inapproximabilty of densest k-subgraph from average case hardness , 2011 . Manuscript , 6 (2011). Noga Alon, Sanjeev Arora, Rajsekar Manokaran, Dana Moshkovitz, and Omri Weinstein. 2011. Inapproximabilty of densest k-subgraph from average case hardness, 2011. Manuscript, 6 (2011).

4. Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation

5. Finding Dense Subgraphs with Size Bounds

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

1. Hardness of Deceptive Certificate Selection;Communications in Computer and Information Science;2023