Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Thursday, February 16, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Patrick Traxler (TU Wien)

Recognizing Transversal Hypergraphs

In this talk we present the problem of recognizing transversal hypergraphs. Given two hypergraphs G and H, decide if G is the transversal hypergraph of H, symbolically G = Tr(H). The transversal hypergraph Tr(H) of H is the set of all subset-minimal transversals (vertex covers) of H. It is open whether there exists a polynomial time algorithm for this problem. The problem is not known to be complete for NP or coNP. The currently best upper time bound is n^o(lg(n)). The complementary problem can be solved on a nondeterministic Turing machine with a polylogarithmic amount of nondeterministic bits. We shortly discuss these results and some related problems.

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

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