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, August 21, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Walter Morris (George Mason Univ., Virginia)

Good Hidden P-matrix Sandwiches

We introduce two new classes of matrices that contain the class of P-matrices and can be recognized in polynomial time. These classes are related to the known classes of Hidden Minkowski and hidden positive row diagonally dominant matrices, which are subclasses of the P-matrix class. We show that for 3x3 matrices, the class of hidden prdd matrices coincides with the class of P-matrices. Alternative theorems for these hidden matrix classes are given and it is shown how one can use them to efficiently check membership in these classes.

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