Strongly refuting random CSPs below the spectral threshold-Reference-Cited by-同舟云学术

Strongly refuting random CSPs below the spectral threshold

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Raghavendra Prasad¹,Rao Satish¹,Schramm Tselil¹

Affiliation:

1. University of California at Berkeley, USA

Publisher

ACM

Link

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

Reference46 articles.

1. Strongly refuting random CSPs below the spectral threshold

2. Sarah R. Allen Ryan O’Donnell and David Witmer. 2015. Sarah R. Allen Ryan O’Donnell and David Witmer. 2015.

3. How to Refute a Random CSP

4. Noga Alon Sanjeev Arora Rajsekar Manokaran Dana Moshkovitz and Omri Weinstein. 2011. Inapproximability of densest κ-subgraph from average case hardness. Unpublished manuscript (2011). Noga Alon Sanjeev Arora Rajsekar Manokaran Dana Moshkovitz and Omri Weinstein. 2011. Inapproximability of densest κ-subgraph from average case hardness. Unpublished manuscript (2011).

5. Public-key cryptography from different assumptions

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

1. How Random CSPs Fool Hierarchies;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

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

4. Subexponential-Time Algorithms for Sparse PCA;Foundations of Computational Mathematics;2023-01-19

5. Disordered systems insights on computational hardness;Journal of Statistical Mechanics: Theory and Experiment;2022-11-01