Michal Koucky
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 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Journey with Eric Allender: From Turing Machines to Circuits, and Back | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Tracks historical reductions and concrete proofs: shows Valiant‑Vazirani isolation turning NP instances into ones with a single accepting path, recalls… | ||
| Lower Bounds for Elimination via Weak Regularity | Interactive Complexity 2018 | 2018-10-15 |
Proves a quantitative lower bound for elimination: any distributional deterministic protocol for k independent copies must use at least… | ||
| Boolean Matrix Multiplication Lower Bounds | Boolean Devices 2018 | 2018-09-10 |
Proves explicit lower bounds for restricted “combinatorial” Boolean matrix multiplication: the classic Angluin model (binary union circuits) needs Ω(n^2 / log… | ||
| nothing matches | ||