Troy Lee
where else to find them
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 |
|---|---|---|
| On a Composition Theorem for Randomized Query Complexity | Interactive Complexity 2018 | 2018-10-15 |
Proves a composition lower bound showing randomized query complexity can drop to R(F)·√R(G) and gives a matching example: an outer relation with R(F)=Θ(√n) and… | ||
| nothing matches | ||