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.
To add/edit talks, please log in on the department web page, then return to Announce. Alternatively if you know the Announce
username/password, click the link below: