註冊並分享邀請連結,可獲得影片播放與邀請獎勵。

Chris Peikert
@ChrisPeikert
Cryptographer (lattices/post-quantum), Professor @UMichCSE, CS(cientific)O @AlgorandFoundation, PhD @MIT_CSAIL. Previously @gatech_scs. Here I speak for myself.
加入 April 2016
58 正在關注    6.9K 粉絲
WOW!! 🤯 Among many jaw-dropping results, this proves NP-hardness of the Closest Vector and Nearest Codeword Problems for *polynomial* approximation factors, for the first time ever, and via a totally new approach (Reed-Solomon techniques). Amazing!
顯示更多
0
11
660
66
轉發到社區