Abstract: Parameterized complexity is a theory allowing a finer analysis of the complexity of algorithms, which was originally applied to graph problems. In this talk, I will survey recent results on the use of parameters for algorithmic and combinatorial topology, with a focus on knots and 3-manifolds. I will try to motivate and highlight the particular flavor of parameterized complexity when applied to the computation of quantum invariants, at the interface of topology, classical and quantum computational complexity, and combinatorics

Zoom Info:

https://zoom.us/j/94529451960?pwd=ekkxYUsrRGt5bVdEQWJRN0JOZ04wZz09

Meeting ID: 945 2945 1960

Passcode: JSJDecomp

Join by Skype for Business

https://zoom.us/skype/94529451960

Join our Cloud HD Video Meeting

Zoom is the leader in modern enterprise video communications, with an easy, reliable cloud platform for video and audio conferencing, chat, and webinars across mobile, desktop, and room systems. Zoom Rooms is the original software-based conference room solution used around the world in board, conference, huddle, and training rooms, as well as executive offices and classrooms. Founded in 2011, Zoom helps businesses and organizations bring their teams together in a frictionless environment to get more done. Zoom is a publicly traded company headquartered in San Jose, CA.

zoom.us

______________________

Neil R. Hoffman

Assistant Professor

Department of Mathematics

523 Math Science Building

Oklahoma State University

Stillwater, OK 74078-1058

405-744-7791

http://math.okstate.edu/people/nhoffman