1 paper
Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov +1
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by…