Huck Bennett
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
- Chris Peikertonce
- Yi Tangonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey | Quantum and Lattices Joint Reunion Workshop | 2022-06-13 |
Claims a simpler randomized NP‑hardness reduction for GAP‑SVP that builds Reed–Solomon parity‑check lattices (prime Q, K ≈ Q^ε), shows L1 minimum distance ≈ 2K… | ||
| Improved Hardness of BDD and SVP Under Gap-(S)ETH | ITCS 2022 | 2022-01-31 |
Shows fine-grained hardness reductions from SAT to lattice problems using locally dense gadgets and two-point counts, proving BDD cannot be solved in 2^{o(n)}… | ||
| nothing matches | ||