Pages that link to "Item:Q3579632"
From MaRDI portal
The following pages link to Two-query PCP with subconstant error (Q3579632):
Displayed 34 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- Satisfying Degree-d Equations over GF[2] n (Q3088098) (← links)
- (Q4638096) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- (Q5002681) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5092401) (← links)
- (Q5115779) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- (Q5743433) (← links)
- (Q5857610) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- (Q5870293) (← links)
- (Q5875460) (← links)
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5885585) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)