The first coefficient of Homflypt and Kauffman polynomials: Vertigan proof of polynomial complexity using dynamic programming

DOI10.1090/conm/689/13860zbMath1386.57021arXiv1707.07733MaRDI QIDQ4635086

Józef H. Przytycki

Publication date: 13 April 2018

Published in: Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.07733

zbMATH Keywords

complexity; dynamic programming; computation; knot polynomials

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)