Hanlin Ren
where else to find them
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 |
|---|---|---|
| NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Proves NP-hardness of approximating Minimum Oracle Circuit Size Problem with a near‑optimal gap: Yes instances admit O‑oracle circuits of size ≤ 2^{ε n}, No… | ||
| Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Presents the first unconditional FP^NP algorithm for ACC^0-Avoid and also gives FP^NP procedures for ACC^0-Remote-Point and ACC^0-Partial-AvgHard with… | ||
| nothing matches | ||