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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 20, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Bernd Gärtner

Semiproduct Unique Sink Orientations

We recently proved that P-matrix linear complementarity problems with tridiagonal (or more generally, upper or lower Hessenberg) matrices can be solved in polynomial time. But don't be afraid, I will not talk about this. Instead, I will introduce semiproduct unique sink orientations, the combinatorial framework underlying the result, and show the polynomial time algorithm in this framework.


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

Previous talks by year:   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