Pages that link to "Item:Q4978006"
From MaRDI portal
The following pages link to How well do local algorithms solve semidefinite programs? (Q4978006):
Displaying 5 items.
- Convex relaxation methods for community detection (Q2038282) (← links)
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283) (← links)
- On the computational tractability of statistical estimation on amenable graphs (Q2067660) (← links)
- Suboptimality of local algorithms for a class of max-cut problems (Q2421823) (← links)
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (Q6076731) (← links)