The number of Reidemeister moves for splitting a link (Q1779178)

Let \(c=10^{11}\), then \(2^{cn}\) is a bound on the number of Reidemeister moves necessary to unknot a knot with \(n\) crossings [\textit{J. Hess} and \textit{J. Lagarias}, J. Am. Math. Soc. 14, 399--428 (2001; Zbl 0964.57005)]. The author proves the existence of a (really big) upper bound on the number of Reidemeister moves necessary to split a splittable link with \(n\) crossings.