Subexponentially computable truncations of Jones-type polynomials
Teresa M. Przytycka, Józef H. Przytycki · Contemporary mathematics - American Mathematical Society · 1993
We show that an essential part of the new (Jones-type) polynomial link invariants can be computed in subexponential time. This is in a sharp contrast to the result of Jaeger, Vertigan and Welsh that computing the whole polynomial and most of its evaluations is #P-hard.