Pages that link to "Item:Q3608306"
From MaRDI portal
The following pages link to More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306):
Displaying 14 items.
- Max NP-completeness made easy (Q1960655) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (Q2941514) (← links)
- Query efficient PCPs with perfect completeness (Q3002760) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- A two-prover one-round game with strong soundness (Q3191598) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
- Two-query PCP with subconstant error (Q3579632) (← links)
- Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
- (Q4938786) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
- STACS 2005 (Q5710674) (← links)