Pages that link to "Item:Q645126"
From MaRDI portal
The following pages link to Spectral algorithms for unique games (Q645126):
Displayed 8 items.
- Making the Long Code Shorter (Q3449561) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Q5075818) (← links)
- (Q5092461) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)