Is a Knot Classification possible?
From MaRDI portal
Publication:6502180
arXivq-alg/9501022MaRDI QIDQ6502180FDOQ6502180
Authors: Charilaos N. Aneziris 
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.
This page was built for publication: Is a Knot Classification possible?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6502180)
