The following pages link to (Q3549678):
Displayed 7 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)
- 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)