Timeline for What part is left unsolved in the Unknotting problem? (after results of Bar-Natan, Khovanov, Kronheimer and Mrowka)
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2021 at 10:42 | comment | added | Mark Bell | And the video of Marc's talk is here: video.ucdavis.edu/media/quasipolynomial-unknot/1_w3i5jvqi | |
| Feb 3, 2021 at 5:49 | comment | added | Ian Agol | Here's a link to the slides from Marc's talk: people.maths.ox.ac.uk/lackenby/quasipolynomial-talk.pdf | |
| Feb 3, 2021 at 1:25 | history | edited | Sam Nead | CC BY-SA 4.0 |
added 270 characters in body
|
| Feb 29, 2016 at 5:44 | comment | added | David Eppstein | Two minor points to add to this: First, I assume it's $\exp(c\sqrt n)$ for some (possibly unknown) constant $c$, rather than necessarily $c=1$. And second, $\exp(c\sqrt n)$ is a typical time bound for many NP-complete problems on planar graphs (and knot diagrams are, essentially, planar graphs). So one shouldn't conclude that this subexponential time bound is low enough to make polynomial time likely — many other problems have the same bound and are still very unlikely to be polynomial. | |
| Feb 27, 2016 at 11:33 | vote | accept | Omri | ||
| Feb 27, 2016 at 11:33 | comment | added | Omri | Sam, thanks for the answer, it appears I had a confusion about the values of C1 and b which are given in the introduction of Bar-Natan's paper. | |
| Feb 27, 2016 at 11:22 | history | answered | Sam Nead | CC BY-SA 3.0 |