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

Date and Time: Tuesday, October 16, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Dominik Scheder

Saving Space -- Two Classical Results from Complexity Theory

When thinking about complexity of decision problems, we are used to focus on time complexity. In this talk, I will state and prove two classical results of complexity theory relating to space, Savitch's Theorem and the Immerman-Szelepcsenyi Theorem. Despite being well-known theorems, their beautiful and surprising proofs are not as widely known as they are for other results in this area (Cook's Theorem stating that SAT is NP-complete, for instance).

Both theorems can be stated as results on how much space we need to solve the innocent reachability problem in directed graphs. Sloppily spoken, Savitch's Theorem implies that with respect to space complexity, nondeterminism is not much more powerful than determinism. Note that stark contrast to time complexity, where P e NP is widely believed to be true.

The Immeran-Szelepcsenyi Theorem implies that (most) nondeterministic space classes are closed under complement, i.e., NSPACE(...) = coNSPACE(...) (for decent "..."). Again, this is in contrast to time complexity, where most of us believe that NP e coNP.

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