Pages that link to "Item:Q2421823"
From MaRDI portal
The following pages link to Suboptimality of local algorithms for a class of max-cut problems (Q2421823):
Displayed 21 items.
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 (Q1731967) (← links)
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model (Q2031482) (← links)
- The overlap gap property in principal submatrix recovery (Q2067659) (← links)
- Optimization of mean-field spin glasses (Q2072085) (← links)
- Minimum 2-dominating sets in regular graphs (Q2091810) (← 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)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- The algorithmic hardness threshold for continuous random energy models (Q2176074) (← links)
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models (Q2227713) (← links)
- Asymptotic bounds on total domination in regular graphs (Q2659200) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- Surfing on minima of isostatic landscapes: avalanches and unjamming transition (Q5857514) (← links)
- (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
- Free energy subadditivity for symmetric random Hamiltonians (Q6042772) (← links)
- Generalized TAP Free Energy (Q6049743) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Free Energy Wells and Overlap Gap Property in Sparse PCA (Q6074556) (← links)
- Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
- Optimizing mean field spin glasses with external field (Q6186448) (← links)
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)