Abstract
We prove that any diagram of the unknot with $c$ crossings may be reduced to the trivial diagram using at most $(236 \,c)^{11}$ Reidemeister moves.
We prove that any diagram of the unknot with $c$ crossings may be reduced to the trivial diagram using at most $(236 \,c)^{11}$ Reidemeister moves.
Full Article