Editing Talk:399: Travelling Salesman Problem
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 66: | Line 66: | ||
:Actually, it's not O(n!) that is equivalent to O(n log(n)), but O(log(n!)) is. See {{w|Stirling formula}} for details. | :Actually, it's not O(n!) that is equivalent to O(n log(n)), but O(log(n!)) is. See {{w|Stirling formula}} for details. | ||
:Seems your memory just dropped that log. [[Special:Contributions/198.41.242.245|198.41.242.245]] 08:57, 27 June 2016 (UTC) | :Seems your memory just dropped that log. [[Special:Contributions/198.41.242.245|198.41.242.245]] 08:57, 27 June 2016 (UTC) | ||
β |