Dana Moshkovitz
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Coding Theory in Almost Linear Time and Sublinear Space | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Constructs asymptotically good codes that achieve deterministic encoding or deterministic decoding in n^{1+o(1)} time while using sublinear space, splitting… | ||
| Crash Course on Probabilistically Checkable Proofs (PCP)... | Probability, Geometry, and Computation in High Dimensions Boot Camp (Simons Institute, Fall 2020) | 2020-08-19 |
Gives a constructive weak PCP: map any system of quadratic mod‑2 equations E to a huge Ẽ where each new equation touches only three bits, E satisfiable… | ||
| Crash Course on Probabilistically Checkable Proofs (PCP): Optimal Inapproximability Results | Probability, Geometry, and Computation in High Dimensions Boot Camp (Simons Institute, Fall 2020) | 2020-08-19 |
Claim: assuming the Unique Games Conjecture, it is NP‑hard to beat the Goemans-Williamson ~0.878 approximation for Max‑Cut. The reduction replaces each… | ||
| An Approach To The Sliding Scale Conjecture Via Parallel Repetition For Low Degree Testing | Quantum Games and Protocols | 2014-02-24 |
Proposes repeating the low‑degree (line vs line) test in parallel to turn a base soundness of about 1/|F| into error roughly 1/|F|^k, and proves this by… | ||
| nothing matches | ||