Timeline for Is there a lower bound for the computational complexity of the traveling salesman problem?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2017 at 22:35 | comment | added | LegionMammal978 | @gnasher729 Polynomial is certainly a lower bound, though. | |
| Nov 12, 2017 at 16:24 | comment | added | gnasher729 | But 1.99999^n is not polynomial. | |
| Nov 12, 2017 at 15:17 | history | edited | user117147 | CC BY-SA 3.0 |
added 4 characters in body
|
| Nov 12, 2017 at 15:13 | review | First posts | |||
| Nov 12, 2017 at 15:17 | |||||
| Nov 12, 2017 at 15:12 | history | answered | user117147 | CC BY-SA 3.0 |