1995/05/02 by Aneziris, Charilaos
#Algebraic Geometry (math.AG) #FOS: Mathematics #Quantum Algebra (math.QA)
paper · doi:10.48550/arxiv.q-alg/9505003
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical aspects related to running these algorithms as computer programs. Further on, we reach a solution by improving on the efficiency of these algorithms, and by introducing new ones.