Oberseminar "Theoretische Informatik"

Ever since the fundamental work of Cook from 1971, satisfiability has been recognized as a central problem in computational complexity. It is widely believed to be intractable, and yet till recently even a linear-time logarithmic-space algorithm was not ruled out. Recent years have seen considerable progress in time-space lower bounds for satisfiability and closely related problems on deterministic, randomized, and quantum machines. This talk will survey the state-of-the-art and give a flavor of the arguments involved. Dieter van Melkebeek, University of Wisconsin