Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, January 29, 2008, 12:15 pm

**Duration**: This information is not available in the database

**Location**: OAT S15/S16/S17

**Speaker**: Dominik Scheder

The ultimate goal of derandomisation theory is to obtain general method to derandomize *every* BPP algorithm (i.e., polynomial time randomized algorithm). The core idea is to feed the randomized Turing machine not with perfect random bits, but bits that look random to it, though they are generated by a pseudo-random generator.

A crucial result is that good random generators can be built using certain hard languages, that is, languages that have exponential complexity on Turing machines as well as for Boolean circuits. It is not known whether such languages exist: Note that every language has at most exponential circuit complexity, but may well have super-exponential complexity on Turing machines.

This result is surprising because it connects a positive complexity result, i.e. possibility of derandomizing all BPP algorithms, with a negative complexity result, namely the existence of certain hard languages.

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