Alexander Sherstov
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| The Hardest Halfspace | Interactive Complexity 2018 | 2018-10-15 |
Constructs an explicit hardest halfspace on {0,1}^{2n} whose degree-D polynomial (and rational) pointwise approximation error stays 1 − 2^{-Ω(n/D)}, matching… | ||
| nothing matches | ||