A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

Published:2019-01 Issue:2 Volume:48 Page:687-735
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Barak Boaz,Hopkins Samuel,Kelner Jonathan,Kothari Pravesh K.,Moitra Ankur,Potechin Aaron

Funder

MIT NEC Corporation

Google

National Science Foundation

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

https://epubs.siam.org/doi/pdf/10.1137/17M1138236

Reference23 articles.

1. Computational complexity and information asymmetry in financial products

2. On Worst‐Case to Average‐Case Reductions for NP Problems

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

1. 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

2. On the Fourier Coefficients of High-Dimensional Random Geometric Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

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

4. Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics;SIAM Journal on Computing;2024-02-13

5. The Spectrum of the Grigoriev–Laurent Pseudomoments;SIAM Journal on Discrete Mathematics;2024-01-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP