Sum of squares lower bounds for refuting any CSP-Reference-Cited by-同舟云学术

Sum of squares lower bounds for refuting any CSP

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:

Kothari Pravesh K.¹,Mori Ryuhei²,O'Donnell Ryan³,Witmer David³

Affiliation:

1. Princeton University, USA / IAS, USA

2. Tokyo Institute of Technology, Japan

3. Carnegie Mellon University, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference68 articles.

1. {AAM + 11} Noga Alon Sanjeev Arora Rajsekar Manokaran Dana Moshkovitz and Omri Weinstein. Inapproximability of densest κ-subgraph from average case hardness. 2011. {AAM + 11} Noga Alon Sanjeev Arora Rajsekar Manokaran Dana Moshkovitz and Omri Weinstein. Inapproximability of densest κ-subgraph from average case hardness. 2011.

2. Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

3. {ABR12} Benny Applebaum Andrej Bogdanov and Alon Rosen . A dichotomy for local small-bias generators. In Ronald Cramer editor Theory of Cryptography volume 7194 of Lecture Notes in Computer Science pages 600– 617 . Springer Berlin Heidelberg 2012. 10.1007/978-3-642-28914-9_34 {ABR12} Benny Applebaum Andrej Bogdanov and Alon Rosen. A dichotomy for local small-bias generators. In Ronald Cramer editor Theory of Cryptography volume 7194 of Lecture Notes in Computer Science pages 600–617. Springer Berlin Heidelberg 2012. 10.1007/978-3-642-28914-9_34

4. Public-key cryptography from different assumptions

5. Optimizing budget allocation among channels and influencers

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

1. Algorithmic obstructions in the random number partitioning problem;The Annals of Applied Probability;2023-12-01

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

3. Sum of Squares Bounds for the Empty Integral Hull Problem;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

4. Algorithms Approaching the Threshold for Semi-random Planted Clique;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02