Mika Göös
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 4 in the filters
on a stage with
- Noah Flemingonce
- Robert Robereonce
- Stefan Grosseronce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Top-Down Lower Bounds for Depth-Four Circuits | Structural Results 2023 | 2023-07-20 |
New top-down proof shows parity needs size exp(Θ(n^{1/3})) for depth‑4 circuits by combining two concrete tools: a block unpredictability lemma that picks… | ||
| On Semi-Algebraic Proofs and Algorithms | ITCS 2022 | 2022-01-31 |
Shows that minimizing conical junta degree on the violations polynomial exactly matches Sherali‑Adams degree via a Hrubeš‑style factorization, uses slack… | ||
| Monotone Circuit Lower Bounds from Resolution (Now with Applications!) | Boolean Devices 2018 | 2018-09-10 |
Gives a lifting theorem that converts resolution refutation lower bounds into exponential monotone circuit lower bounds by composing hard CNF instances with a… | ||
| Independent Set Polytopes: Query vs. Communication Perspective | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Constructs n‑node graphs whose independent set polytope provably requires extension complexity nearly maximal namely exp(n / log n), via a reduction from a… | ||
| nothing matches | ||