Pages that link to "Item:Q2941492"

The following pages link to Sum-of-squares Lower Bounds for Planted Clique (Q2941492):

Displaying 20 items.

• An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
• (Q4558170) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
• Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log^*|<i>V</i>|) time (Q4684942) (← links)
• The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
• (Q5005186) (← links)
• (Q5009502) (← links)
• (Q5075740) (← links)
• (Q5090440) (← links)
• (Q5091238) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)