Trivialer Knoten (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Trivialer Knoten" in German language version.

refsWebsite
Global rank German rank
69th place
189th place
1st place
1st place
513th place
549th place
458th place
30th place
low place
low place
low place
3,481st place
274th place
152nd place

arxiv.org

  • Hass, Joel; Lagarias, Jeffrey C.; Pippenger, Nicholas: The computational complexity of knot and link problems, Journal of the ACM 46(2), 185–211 (1999). Arxiv
  • Benjamin A. Burton, Maximal admissible faces and asymptotic bounds for the normal surface solution space, Journal of Combinatorial Theory, Series A, Band 118, 2011, S. 1410–1435, Arxiv
  • Marc Lackenby: The effizient certification of knottedness and Thurston norm
  • Joan Birman, Michael Hirsch: A new algorithm for recognizing the unknot, Geometry and Topology, Band 2, 1998, S. 178–220, Arxiv
  • Hass, Lagarias, The number of Reidemeister moves needed for unknotting, Journal of the American Mathematical Society, Band 14, 2001, S. 399–428, Arxiv

scienceblogs.de

springer.com

link.springer.com

tagesspiegel.de

theoremoftheday.org

web.archive.org

wolfram.com

mathworld.wolfram.com