Timeline for Algorithmically unsolvable problems in topology
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2013 at 17:20 | answer | added | Omar Antolín-Camarena | timeline score: 1 | |
| Feb 12, 2013 at 14:12 | answer | added | Marek Krčál | timeline score: 13 | |
| Jun 3, 2012 at 16:50 | comment | added | algori | Mark -- thanks, I did mean at, not ag. | |
| Jun 2, 2012 at 18:20 | comment | added | Sergey Melikhov | To anticipate Tim Perutz' more substantial comment below, the simply-connected homeomorphism problem for PL manifolds (and more) is done in the Nabutovsky-Weinberger paper arxiv.org/abs/math/9707232. | |
| Jun 2, 2012 at 17:17 | comment | added | Mark Grant | You might also be interested in "Complexity in rational homotopy" by Lechuga and Murillo. They show that various problems in rational homotopy are NP-hard. | |
| Jun 2, 2012 at 15:37 | comment | added | Mark Grant | I changed the ag tag to at (hopefully this was what was intended). | |
| Jun 2, 2012 at 15:36 | history | edited | Mark Grant |
fixed tags
|
|
| Jun 1, 2012 at 23:46 | answer | added | Joseph O'Rourke | timeline score: 5 | |
| Jun 1, 2012 at 23:16 | answer | added | Vitali Kapovitch | timeline score: 6 | |
| Jun 1, 2012 at 22:16 | history | asked | algori | CC BY-SA 3.0 |