Ján Pich
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
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Towards P≠NP from Extended Frege Lower Bounds | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
If (a) S^1_2 proves a concrete E-function is hard to approximate by subexponential circuits and (b) S^1_2 proves a p-time reduction turns circuits breaking… | ||
| nothing matches | ||