31 Dec
2013
31 Dec
'13
12:26 p.m.
that's fantastic! this is then an elementary proof that Unknot is in NP. Cris On Dec 31, 2013, at 11:37 AM, Warren D Smith <warren.wds@gmail.com> wrote:
In what would seem to be a fantastic result, Marc Lackenby: A polynomial upper bound on Reidemeister moves, http://arxiv.org/abs/1302.0180
claims to prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (231*c)^11 Reidemeister moves. He depends heavily on http://arxiv.org/abs/math/0208153