this post was submitted on 31 Dec 2024
5 points (100.0% liked)

Lobste.rs

101 readers
13 users here now

RSS Feed of lobste.rs

founded 4 months ago
MODERATORS
[email protected]
[email protected]
5
Solving the Traveling Salesman Problem: From Heuristics to a Potential Polynomial-Time Breakthrough (prat8897.github.io)
submitted 1 month ago by [email protected] to c/[email protected]
2 comments fedilink hide all child comments
 

Comments

top 2 comments
sorted by: hot top controversial new old
[โ€“] afk_strats 1 points 1 month ago

Can anyone temper my expectations here? This seems like it could be a monumental breakthrough in algorithms and it's dead simple?

[โ€“] thevoidzero 1 points 1 month ago

It's there going to be a paper? If it's true, it seems simple enough to implement/understand but very significant.