Pages that link to "Item:Q3075461"
From MaRDI portal
The following pages link to How to Play Unique Games on Expanders (Q3075461):
Displaying 12 items.
- Tilings of rectangles with T-tetrominoes (Q596042) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- How to play Thue games (Q2342675) (← links)
- Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
- Unique games on expanding constraint graphs are easy (extended abstract) (Q3549678) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- (Q5092461) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
- Efficient algorithms for the Potts model on small-set expanders (Q6538425) (← links)