The parametrized complexity of knot poly
β
J.A. Makowsky; J.P. MariΓ±o
π
Article
π
2003
π
Elsevier Science
π
English
β 195 KB
We study the parametrized complexity of the knot (and link) polynomials known as Jones polynomials, Kauffman polynomials and HOMFLY polynomials. It is known that computing these polynomials is xP hard in general. We look for parameters of the combinatorial presentation of knots and links which make