Pages that link to "Item:Q5230352"
From MaRDI portal
The following pages link to On non-optimally expanding sets in Grassmann graphs (Q5230352):
Displaying 21 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)
- Online learning for min-max discrete problems (Q2166779) (← links)
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY (Q4635501) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5009534) (← links)
- (Q5009543) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- (Q5090379) (← links)
- (Q5090410) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- (Q5092461) (← links)
- Three candidate plurality is stablest for small correlations (Q5154790) (← links)
- (Q5875456) (← links)
- Hypercontractivity for global functions and sharp thresholds (Q6053547) (← 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)
