Pages that link to "Item:Q3002760"
From MaRDI portal
The following pages link to Query efficient PCPs with perfect completeness (Q3002760):
Displaying 17 items.
- Combinatorial PCPs with efficient verifiers (Q483706) (← links)
- 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)
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← 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)
- Simple PCPs with poly-log rate and query complexity (Q3581427) (← 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)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
- STACS 2005 (Q5710674) (← links)
- Small PCPs with low query complexity (Q5946703) (← links)