News for hackers. Stuff that matters.
Re:P vs. NP by cyorir on Tuesday January 03, 2017 @11:07PM (#13315608)
I'll read this if I can afford the time! It would be nice if there were a summary more detailed than the abstract but still short relative to the length of the article (say, 10-pages long?).
Re:P vs. NP by powera on Wednesday January 04, 2017 @01:17AM (#13316076)
If I had to summarize it from one sentence from the article, I'd go with:

"The one prediction I feel confident in making is that the idea of “ironic complexity theory”—i.e., of a profound duality between upper and lower bounds, where the way to prove that there’s no fast algorithm for problem A is to discover fast algorithms for problems B, C, and D—is here to stay."

Re:P vs. NP by idlewords on Wednesday January 04, 2017 @11:27AM (#13319580)
Just skim it, and read pieces that catch your eye. It's well-organized.