Sciweavers

72
Voted
DCG
2010
101views more  DCG 2010»
14 years 7 months ago
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with ...
Joel Hass, Tahl Nowik
49
Voted
LATA
2009
Springer
15 years 3 months ago
Automata on Gauss Words
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
Alexei Lisitsa, Igor Potapov, Rafiq Saleh