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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, April 16, 2015, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Jerri Nummenpalo

Many problems in combinatorics can be formulated in terms of linear programs whose feasible regions are polytopes. Often, such polytopes are described by exponentially many linear inequalities. Extension complexity asks if there is a way to represent a given polytope in a higher dimensional space - a lifted polytope - so that fewer inequalities are needed. Yannakakis showed in the 90s a way to give lower bounds for the number of inequalities needed to describe any lifted polytope which maps linearly to the original polytope. Recently, new lower bounds on the extension complexity of interesting polytopes were attained. In this talk we introduce the concept of extension complexity of polytopes, look at ways to bound it and review some of these recent results.

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