The seminar seeks to bring together researchers who are interested in exploring the rich interplay between continuous and discrete methods in theoretical computer science.   The importance of continuous methods can hardly be overstated and ideas with deep roots in continuous domains have been the central workhorse of remarkable progress on lots of fundamental problems in discrete optimization and complexity over the last several years. The goal of the seminar is to facilitate senior researchers and students from various areas in learning tools and techniques from continuous domains, as well as in exploring potential problems where these methods can be effectively applied.

The seminar will have a set of tutorial talks from expert researchers introducing continuous methods and how they are applied to problems in various areas like combinatorial optimization, average case algorithms, sampling in high dimensions, non-commutative optimization, topological combinatorics, coding theory and polynomial factorization. Additionally, there will be advanced research talks from participants on a voluntary basis.