Timeline for Powerful Algorithms too complex to implement
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2011 at 15:54 | history | edited | Anthony Labarre | CC BY-SA 2.5 |
fixed according to JeffE's comment
|
| Jan 27, 2011 at 14:45 | comment | added | Jeffε | Haken gave the first algorithm, but it does not run in polynomial time; in fact, no poly-time algorithm (or NP-hardness result) is known. More recent work has reduced knot triviality (via Haken's normal-surface formulation) to integer programming, which is usually quick to solve in practice. | |
| S Jan 24, 2011 at 8:57 | history | answered | Anthony Labarre | CC BY-SA 2.5 | |
| S Jan 24, 2011 at 8:57 | history | made wiki | Post Made Community Wiki |