Igor Oliveira
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
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Unconditional result: APC_1 cannot prove LB3 — a single sentence asserting a mild average‑case separation between ∃∀∃ and ∀∃∀ circuits (poly‑size π3 versus… | ||
| Addition is Exponentially Harder than Counting for Shallow Monotone Circuits | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Defines U_d_n as d n‑bit numbers whose sum is at least 2^n, a monotone function represented by a single threshold gate. Proves any depth-d monotone majority… | ||
| nothing matches | ||