Bruno P. Cavalar
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 1 in the filters
on a stage with
- Zhenjian Luonce
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Algorithms and Lower Bounds for Comparator Circuits from Shrinkage | ITCS 2022 | 2022-01-31 |
Proves an average-case lower bound: there is an explicit polynomial-time function f on n bits such that every comparator circuit with at most n^{1.5} gates… | ||
| nothing matches | ||