Timeline for Traveling Pumpkin Problem
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Nov 26, 2016 at 17:57 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 160 characters in body
|
| Oct 27, 2016 at 14:30 | comment | added | Luis Mendo | @edc65 Ah, I see. 1000 villages seems unrealistic if the problem is NP-hard, as it appears to be | |
| Oct 27, 2016 at 13:30 | comment | added | edc65 | In a comment, OP request to manage up to 1000 villages. But any answer that generates and stores all permutations will fail even 15 villages (~1300 billion permutations) | |
| Oct 26, 2016 at 13:32 | comment | added | Luis Mendo | @edc65 No, that's too much (there are over 10^2500 permutations of 1000 elements). I don't think any language can | |
| Oct 26, 2016 at 12:55 | comment | added | edc65 | can MATL really generate all permutation of 1000 (x,y) pairs? | |
| Oct 24, 2016 at 21:26 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 855 characters in body
|
| Oct 24, 2016 at 21:19 | history | edited | Luis Mendo | CC BY-SA 3.0 |
edited body
|
| Oct 24, 2016 at 21:12 | history | edited | Luis Mendo | CC BY-SA 3.0 |
edited body
|
| Oct 24, 2016 at 20:52 | history | answered | Luis Mendo | CC BY-SA 3.0 |