# Seminars

The Theoretical Computer Science and Discrete Mathematics Seminars will take place every Monday at 11:00 a.m. - 12:00 p.m. and every Tuesday at 10:30 a.m. - 12:30 p.m. at the Institute for Advanced Study. The lectures will be held in S-101, the seminar room in Simonyi Hall, unless stated otherwise.

If you are interested in attending future seminars and are not already on our mailing list from previous years, please send an e-mail to Andrea Lass and ask to be added.

## Upcoming Seminar Titles Include:

### Computer Science/Discrete Mathematics Seminar I

Where are the hard problems? In the absence of a proof of P ≠
NP, researchers have spent years proving unconditional lower bounds
for constrained models of computation. In time, a distinct theme
arose: *random *problems (in particular
random...

### Computer Science/Discrete Mathematics Seminar II

Edit distance is a similarity measure for strings that counts how many characters have to be deleted, inserted or substituted in one string to get another one. It has many applications from comparing DNA sequences to text processing. We are still in...

### Computer Science/Discrete Mathematics Seminar I

In this talk, we will show that the supremum of any centered Gaussian process can be approximated to any arbitrary accuracy by a finite dimensional Gaussian process where the dimension of the approximator is just dependent on the target error. As a...