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: Thursday, February 26, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Robert Hildebrand

Complexity of Polynomial Minimization Over Integer Points in Polyhedra

We focus on the complexity of the problem of minimizing a polynomial function over integer points in a polyhedron. This problem is known to be NP-hard even fixed dimension two and degree four. Recently, Del Pia and Weismantel showed that for fixed dimension two and degree two, this problem can be solved in polynomial time. We continue this classification of problems that can be solved in polynomial time in fixed dimension by determining the complexity for minimizing cubic polynomials and homogeneous polynomials in dimension two over integer points in a polyhedron.

Joint work with: Alberto Del Pia (University of Wisconsin-Madison), Robert Weismantel (ETH Zurich), and Kevin Zemmer (ETH Zurich).

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