Mikito Nanashima
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
on a stage with
- Shuichi Hiraharaonce
who talks about the same things
- Shuichi Hirahara7 talks
- Ran Raz6 talks
- Uma Girish4 talks
- Robert Robere5 talks
- Lijie Chen9 talks
- Prahladh Harsha4 talks
| title | conference | date |
|---|---|---|
| Learning Versus Pseudorandom Generators in Constant Parallel Time | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Proves an equivalence: existence of polynomial-stretch PRGs computable in NC0 (collections and single-generator parity-NC0 cases) is exactly captured by… | ||
| Learning versus Pseudorandom Generators in Constant Parallel Time | ITCS 2023 | 2023-01-10 |
Proves an equivalence: existence of polynomial-stretch pseudorandom generators computable in NC0 is characterized by average-case hardness of weak learning for… | ||
| On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions | ITCS 2021 | 2021-01-06 |
Shows that non-adaptive black-box reductions from NP-hard languages to an auxiliary-input pseudorandom generator would collapse the polynomial hierarchy, using… | ||
| nothing matches | ||