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."
"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."