4 ms·

Lockdown -> O(1) traveling salesperson solution. I think constant runtime is technically not polynomial hard... But seriously this is very cool. Glad to see pro

Lockdown -> O(1) traveling salesperson solution. I think constant runtime is technically not polynomial hard... But seriously this is very cool. Glad to see progress in mathematics.

belinder 6y ago
I'm glad too but it's difficult for me to imagine the improvement when it's > 0.2 billionth of a trillionth of a trillionth of a percent