Seminars

The Theoretical Computer Science and Discrete Mathematics Seminars will take place every Monday at 10:30 a.m. - 11:30 a.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.

alass email

 

Upcoming Seminar Titles Include:

Jan
27
2025

Computer Science/Discrete Mathematics Seminar I

On Approximability of Satisfiable Constraint Satisfaction Problems & Applications
Amey Bhangale
10:30am|Simonyi 101 and Remote Access

The satisfiability problem for Constraint Satisfaction Problems (CSPs) asks whether an instance of a CSP has a fully satisfying assignment, i.e., an assignment that satisfies all constraints. This problem is known to be in class P or is NP-complete...

Jan
28
2025

Computer Science/Discrete Mathematics Seminar II

Spectral Algorithms from Induced Subgraphs of Cayley Graphs
Peter Manohar
10:30am|Simonyi 101 and Remote Access

In this talk, we present a new method to solve algorithmic and combinatorial problems by (1) reducing them to bounding the maximum, over x in {-1, 1}^n, of homogeneous degree-q multilinear polynomials, and then (2) bounding the maximum value...

Feb
03
2025

Computer Science/Discrete Mathematics Seminar I

Low-Depth Algebraic Circuit Lower Bounds Over Any Field
Michael A. Forbes
10:30am|Wolfensohn Hall and Remote Access

The recent breakthrough of Limaye, Srinivasan and Tavenas (LST) gave the first super-polynomial lower bounds against low-depth algebraic circuits, for any field of zero (or sufficiently large) characteristic. It was an open question to extend this...

More Events