Igor Carboni Oliveira
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 |
|---|---|---|
| Hardness Magnification | Boolean Devices 2018 | 2018-09-10 |
Magnification claims that a barely superlinear lower bound — roughly n^{1+ε} — for very specific problems yields superpolynomial circuit or formula lower… | ||
| nothing matches | ||