Pages that link to "Item:Q626619"
From MaRDI portal
The following pages link to Approximation resistant predicates from pairwise independence (Q626619):
Displayed 18 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← 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)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← 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)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5077145) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- On the Approximability of Presidential Type Predicates (Q6058187) (← links)