Pages that link to "Item:Q4978004"
From MaRDI portal
The following pages link to On independent sets, 2-to-2 games, and Grassmann graphs (Q4978004):
Displayed 14 items.
- Boolean degree 1 functions on some classical association schemes (Q1633376) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Log-Sobolev inequality for the multislice, with applications (Q2119683) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5009534) (← links)
- (Q5090379) (← links)
- (Q5090410) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← 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)