๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

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!
๋” ๋ณด๊ธฐ