The following pages link to (Q3549678):
Displaying 15 items.
- Spectral algorithms for unique games (Q645126) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← 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)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- (Q5743431) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
