The following pages link to (Q3002760):
Displayed 11 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← 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)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)