Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 04, 2014, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Malte Milatz
Link homology, in particular Khovanov homology, comes in various guises, but in each case it leads to a well-defined computational problem. The most interesting cases are at least as hard as computing the Jones polynomial, which is already #P-hard. As of late I have been interested in the question whether the problem becomes polynomial-time computable when the treewidth of the input (appropiately defined) is bounded.
The talk will be a very general and light-weight introduction. I will give brief accounts of the history of homology, the ideas behind link homology, and reductions of chain complexes. Then I will present a result concerning connected sums.
Automatic MiSe System Software Version 1.4803M | admin login