Pages that link to "Item:Q4634034"

The following pages link to A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034):

Displaying 29 items.

• Algorithmic thresholds for tensor PCA (Q782415) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• On the computational tractability of statistical estimation on amenable graphs (Q2067660) (← links)
• The planted matching problem: phase transitions and exact results (Q2075325) (← links)
• Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
• Optimal low-degree hardness of maximum independent set (Q2113266) (← links)
• Isotonic regression with unknown permutations: statistics, computation and adaptation (Q2119231) (← 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)
• Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• Statistical limits of spiked tensor models (Q2179237) (← links)
• Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
• A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian (Q2235162) (← links)
• Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model (Q5020005) (← links)
• Disordered systems insights on computational hardness (Q5055432) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• (Q5158503) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
• A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
• Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
• Free Energy Wells and Overlap Gap Property in Sparse PCA (Q6074556) (← links)
• Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
• Compressive phase retrieval: Optimal sample complexity with deep generative priors (Q6141977) (← links)
• The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
• Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)