Notes for AKT-090917-1/0:01:03

Computing the tricolouring invariant efficiently: A priori, it is an exponential time problem since for a knot diagram with $n$ arcs we need to consider $3^{n}$ possible colourings. However, the problem can be reduced to Gaussian elimination over $Z/3Z$ and quadratic time. For more details see AKT-09/Tricolourability.