BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Arnaud de Mesmay (LIGM\, Université Paris Est)
DTSTART:20201103T173000Z
DTEND:20201103T180000Z
DTSTAMP:20260423T024829Z
UID:LA-CoCo/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/LA-CoCo/11/"
 >Link crossing number is NP-hard</a>\nby Arnaud de Mesmay (LIGM\, Universi
 té Paris Est) as part of LA Combinatorics and Complexity Seminar\n\n\nAbs
 tract\nMost invariants in knot theory are very hard to compute in practice
 \, yet only few computational hardness proofs are known. In this talk\, we
  survey the computational complexity of many problems coming from knot the
 ory\, emphasizing the numerous open problems\, and we present a proof of N
 P-hardness for the crossing number of a link.\n\nJoint work with Marcus Sc
 haefer and Eric Sedgwick.\n
LOCATION:https://researchseminars.org/talk/LA-CoCo/11/
END:VEVENT
END:VCALENDAR