The following pages link to (Q3002760):
Displayed 3 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)