But it's much better than the prior state of the art which was n^n 2^O(n). [1]
The Quanta article, unfortunately, doesn't bother to report the prior complexity for comparison, despite that that's probably the single most important thing to say in order to support the claim in the article's sub-headline.
cvoss|2 years ago
But it's much better than the prior state of the art which was n^n 2^O(n). [1]
The Quanta article, unfortunately, doesn't bother to report the prior complexity for comparison, despite that that's probably the single most important thing to say in order to support the claim in the article's sub-headline.
[1] https://en.m.wikipedia.org/wiki/Integer_programming#Exact_al...