Year: 1995
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Aneziris, Charilaos
Institution: Deutsches Elektronen-Synchrotron DESY
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1499689752