Michael Forbes
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 |
|---|---|---|
| Derandomization via Robust Algebraic Circuit Lower Bounds | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Shows that depth-3 powering formulas imply a deterministic black-box identity test by turning a known exponential lower bound for the monomial x1 x2 ... xn… | ||
| nothing matches | ||