注册并分享邀请链接,可获得视频播放与邀请奖励。

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
转发到社区