Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, November 19, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Bernd Gärtner
Fourier-Motzkin elimination for systems of inequalities is what Gauss elimination is for systems of equations. In this talk, I will first describe the (utterly simple) Fourier-Motzkin elimination procedure and then give two applications of it: (i) a proof of the Farkas Lemma underlying the linear programming duality theorem, and (ii) a polynomial-time algorithm for finding an integral solution of a system of inequalities with integral coefficients whose absolute values sum up to at most 2 in every left-hand side. The latter algorithm is due to Schrijver and (for example) yields another proof of the fact that the 2-SAT problem is in P.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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