Andrej Bogdanov
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 2 in the filters
on a stage with
all 5 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On the Average-case Complexity of the Nearest Boolean Vector to a Subspace | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Most n-dimensional subspaces of R^m are Ω(√m)-far from {-1,1}^m and there is a non-deterministic interactive algorithm that certifies a random subspace is… | ||
| Bounded indistinguishability for simple sources | ITCS 2022 | 2022-01-31 |
Shows both positive and negative Braverman-style claims: for constant-degree/local sources constant k suffices to fool simple distinguishers, and depth‑one… | ||
| nothing matches | ||