Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 04, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Malte Milatz

Towards better bounds for link homology

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login