arXiv · q-alg/9501022
Is a Knot Classification possible?
Abstract
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed self-avoiding walks.
Explore related subjects
Keep this discovery
Charilaos Aneziris. 1995-01-20. Is a Knot Classification possible?. https://arxiv.org/abs/q-alg/9501022
Cite the original work for its findings. Save a collection to share your selection of sources.