Notes for AKT-090917-1/0:01:03
From Drorbn
Jump to navigationJump to search
Computing the tricolouring invariant efficiently: A priori, it is an exponential time problem since for a knot diagram with [math]\displaystyle{ n }[/math] arcs we need to consider [math]\displaystyle{ 3^n }[/math] possible colourings. However, the problem can be reduced to Gaussian elimination over [math]\displaystyle{ Z/3Z }[/math] and quadratic time. For more details see AKT-09/Tricolourability.
