“…Each of the turning-points is treated as a two-valent vertex on the knot diagram, of type ■ , ✠ , ✒ or | . Table 3: Summary of the discussed approaches, with bibliographic and internal references Khovanov polynomial N = 2 Introduced in [5] Computational technique developed in [18] Table of results, together with computer code [7] Presented for all prime knots (up to 11 crossings) and links (up to 11 crossings); in principle, computed for any knots Reviewed, e.g., in [19,20], [21,9] Khovanov-Rozansky polynomial N ∈ Z + The definition introduced in [4] Applied to explicit computations in [11] "Thin" knots up to 9 crossings [22] Knots and links up to 6 crossings, mostly for particular vales of N The appoach reviewed, e.g., in [21,9] Attemts of modification Tensor-like formalism [23] Simplest examples, 2-strand torus knots, twist knots R-matrix bases formalism [3] 2 and 3-strand torus knots, 3-and 4-strand knots and links up to 6 crossings, twocomponent links from two antiparallel strands ssec. 2,4 Positive division technique [3] ssec.…”