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: Wednesday, April 30, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Antonis Thomas

Recognizability & Long Cycles in USOs

In this talk, the following problem is considered: Given a Boolean Circuit with n inputs and n outputs, decide if it represents a Unique Sink Orientation (USO). We prove this problem to be coNP-complete. However, the situation is more involved for Acyclic USOs (AUSO). While it remains coNP-hard to recognize an AUSO, we leave open the problem of inclusion that there exist cyclic USOs with superpolynomially long cycles.

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