Pages that link to "Item:Q2968165"

The following pages link to Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165):

Displaying 19 items.

• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• Optimization of mean-field spin glasses (Q2072085) (← links)
• Sparse high-dimensional linear regression. Estimating squared error and a phase transition (Q2131259) (← links)
• The overlap gap property and approximate message passing algorithms for \(p\)-spin models (Q2227713) (← links)
• Suboptimality of local algorithms for a class of max-cut problems (Q2421823) (← links)
• On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
• The replica symmetric phase of random constraint satisfaction problems (Q4993097) (← links)
• Biased landscapes for random constraint satisfaction problems (Q5006920) (← links)
• (Q5091194) (← links)
• Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion (Q5857428) (← 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)
• Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem (Q6248698) (← links)
• A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
• The landscape of the planted clique problem: dense subgraphs and the overlap gap property (Q6616866) (← links)
• On perfectly friendly bisections of random graphs (Q6634425) (← links)
• The threshold energy of low temperature Langevin dynamics for pure spherical spin glasses (Q6641013) (← links)
• Tight Lipschitz hardness for optimizing mean field spin glasses (Q6641018) (← links)