Pages that link to "Item:Q3177749"

The following pages link to Subexponential Algorithms for Unique Games and Related Problems (Q3177749):

Displaying 41 items.

• Improved approximation algorithms for projection games (Q513283) (← links)
• Spectral algorithms for unique games (Q645126) (← links)
• Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
• The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
• Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
• New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
• On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
• New Tools for Graph Coloring (Q3088076) (← links)
• Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
• On Khot’s unique games conjecture (Q3109809) (← links)
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
• Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
• On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
• Making the Long Code Shorter (Q3449561) (← links)
• Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
• Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
• A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
• Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
• (Q5005145) (← links)
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
• Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Q5075818) (← links)
• (Q5089227) (← links)
• (Q5090440) (← links)
• (Q5091271) (← links)
• Computational topology and the Unique Games Conjecture (Q5115811) (← links)
• Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
• Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
• The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ ₁ (Q5501953) (← links)
• Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
• Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile (Q5737813) (← links)
• (Q5743431) (← links)
• Bipartite communities via spectral partitioning (Q5918521) (← links)
• Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
• Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
• Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q6139828) (← links)
• Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)