The following pages link to Dana Moshkovitz (Q513282):
Displaying 22 items.
- Improved approximation algorithms for projection games (Q513283) (← links)
- Sub-constant error probabilistically checkable proof of almost-linear size (Q626681) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
- $\mathcal{NP}$-Hardness of Approximately Solving Linear Equations over Reals (Q2848199) (← links)
- Improved Approximation Algorithms for Projection Games (Q2849357) (← links)
- Erratum for (Q2875206) (← links)
- Sub-constant error low degree test of almost-linear size (Q2931366) (← links)
- On basing one-way functions on NP-hardness (Q2931429) (← links)
- (Q2941638) (← links)
- Algorithmic construction of sets for <i>k</i> -restrictions (Q2944511) (← links)
- The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover (Q3167403) (← links)
- Two-query PCP with subconstant error (Q3579632) (← links)
- Sub-Constant Error Low Degree Test of Almost-Linear Size (Q3614153) (← links)
- Approximation Algorithms for Label Cover and The Log-Density Threshold (Q4575796) (← links)
- A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian (Q4636476) (← links)
- (Q4993292) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- Approximating Dense Max 2-CSPs (Q5351913) (← links)
- Candidate hard unique game (Q5361819) (← links)
- NP-hardness of approximately solving linear equations over reals (Q5419111) (← links)
- (Q6126299) (← links)
- (Q6146253) (← links)
