Post

It's crazy. They didn't "only" prove hardness of CVP with a polynomial approximation factor. They also made the first improvement in decades on sphere packing AND on the optimal minimum distance of codes. (And they solved open problems in a bunch of other fields that I know less about.)

That's fair. I think understanding what the "magic ingredients" are (deciphering the paper) is going to take a little time. (The fact that both of you mention the poor writing and exposition is quite interesting and sad (and upsetting), tbh.)

0 reposts3 likes

No replies yet.