BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Marc Lackenby (University of Oxford)
DTSTART:20210520T140000Z
DTEND:20210520T160000Z
DTSTAMP:20260422T065850Z
UID:CJCS/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/16/">Un
 knot recognition in quasi-polynomial time</a>\nby Marc Lackenby (Universit
 y of Oxford) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAb
 stract\nI will outline a new algorithm for unknot recognition that runs in
  quasi-polynomial time. The input is a diagram of a knot with n crossings\
 , and the running time is 2^{O((log n)^3)}. The algorithm uses a wide vari
 ety of tools from 3-manifold theory\, including normal surfaces\, hierarch
 ies and Heegaard splittings. In my talk\, I will explain this background t
 heory\, as well as explain how it fits into the algorithm.\n
LOCATION:https://researchseminars.org/talk/CJCS/16/
END:VEVENT
END:VCALENDAR