Timeline for How do I efficiently find a sequence of Reidemeister moves between equivalent link diagrams?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2014 at 9:06 | vote | accept | Idonknow | ||
| Nov 6, 2013 at 17:31 | comment | added | Ryan Budney | This asserts finding moves between one knot diagram and another isn't a hopeless cause, but it's not efficient. I don't know where people draw the line on the word "efficient" but I usually want it to mean sub-exponential growth, or minimally "not very bad" exponential growth. | |
| Nov 6, 2013 at 16:30 | history | answered | Anonymous | CC BY-SA 3.0 |