|
Please sign your posts with ~~~~
|
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision |
Your text |
Line 123: |
Line 123: |
| | | |
| TSP is NP-hard, not NP-complete [[User:Tembrel|Tembrel]] ([[User talk:Tembrel|talk]]) 00:19, 14 November 2019 (UTC) | | TSP is NP-hard, not NP-complete [[User:Tembrel|Tembrel]] ([[User talk:Tembrel|talk]]) 00:19, 14 November 2019 (UTC) |
− |
| |
− | If you guys like the knapsack problem and simplified stuff, then I've got the game mod for you! https://steamcommunity.com/sharedfiles/filedetails/?id=1844662069 along with https://ktane.timwi.de/HTML/Simon%20Selects.html
| |
− |
| |
− | (I also tried solving this like I would that mod, but then I realized that this problem is not that.) [[Special:Contributions/172.69.34.24|172.69.34.24]] 03:05, 18 July 2020 (UTC)
| |
− |
| |
− | ;On general solutions
| |
− | The explanation seems to assume that general solutions must be in polynomial time, but the comic does not mention that. It seemed to me that finding a non-polynomial general solution (which exist, obviously, with one even described in the explanation) *still* gets a 50% tip, which also means the 50% tip is a lot more reasonable now. While mentioning that no polynomial GS exists is probably still a good idea, it seems to me that the explanation should not assume one is neccessary for the tip. [[Special:Contributions/172.68.238.109|172.68.238.109]] 00:59, 24 October 2022 (UTC)
| |