AUTOMATIC COMPUTATION OF CROSSCAP NUMBER OF ALTERNATING KNOTS

From MaRDI portal
Publication:6170185




Abstract: We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot K, let calE be the number of edges of its diagram. Then there exists a code such that the complexity of this computation of the crosscap number of K is estimated by O(calE3).









This page was built for publication: AUTOMATIC COMPUTATION OF CROSSCAP NUMBER OF ALTERNATING KNOTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170185)