%0 Journal Article
%T Complexity of planar and spherical curves
%A Tahl Nowik
%J Mathematics
%D 2008
%I arXiv
%X We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves along the way having at most n+2 crossings.
%U http://arxiv.org/abs/0802.3021v1