Pages that link to "Item:Q4800393"
From MaRDI portal
The following pages link to Simple analysis of graph tests for linearity and PCP (Q4800393):
Displaying 11 items.
- A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
- On the derandomization of the graph test for homomorphism over groups (Q2430014) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
- (Q5090432) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
