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, March 28, 2024, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Simon Weber
In this talk I present three promise total search problems that all lie in the complexity class PromiseUEOPL. I show that for all of these problems "two choices are enough" by reducing each of these problems to its binary variant and I also show some reductions between these problems.
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