Pages that link to "Item:Q5230304"
From MaRDI portal
The following pages link to Towards a proof of the 2-to-1 games conjecture? (Q5230304):
Displayed 18 items.
- High order random walks: beyond spectral gap (Q2003767) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- Log-Sobolev inequality for the multislice, with applications (Q2119683) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5009534) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- (Q5077145) (← links)
- (Q5090410) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
- (Q5092461) (← links)
- (Q5875456) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- (Q6176154) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)