Pages that link to "Item:Q5920116"
From MaRDI portal
The following pages link to Limits of local algorithms over sparse random graphs (Q5920116):
Displaying 28 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- The local limit of random sorting networks (Q1731150) (← 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)
- Local algorithms for block models with side information (Q2800554) (← links)
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165) (← links)
- Local algorithms for graphs (Q2990203) (← links)
- Ramanujan graphings and correlation decay in local algorithms (Q3452726) (← 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)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- The largest hole in sparse random graphs (Q6052472) (← links)
- Local limits of spatial inhomogeneous random graphs (Q6068844) (← 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)
- Greedy maximal independent sets via local limits (Q6541390) (← 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)
- Counting and hardness-of-finding fixed points in cellular automata on random graphs (Q6639766) (← links)
- Searching for (sharp) thresholds in random structures: where are we now? (Q6658193) (← links)
