Pages that link to "Item:Q5920116"

The following pages link to Limits of local algorithms over sparse random graphs (Q5920116):

Displaying 16 items.

• Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
• Ising model on trees and factors of IID (Q2071790) (← links)
• Optimal low-degree hardness of maximum independent set (Q2113266) (← 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)
• Limits of locally-globally convergent graph sequences (Q2453451) (← links)
• Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165) (← links)
• Weak containment of measure-preserving group actions (Q4970729) (← links)
• Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs (Q5026483) (← links)
• Disordered systems insights on computational hardness (Q5055432) (← links)
• Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
• The largest hole in sparse random graphs (Q6052472) (← links)
• Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
• Shattering versus metastability in spin glasses (Q6180708) (← links)
• Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)