Past Events

A traditional goal of complexity theory is to distinguish between problems that are computationally tractable and those that are not The tractable so called easy problems are solvable in polynomial time and form the complexity class P From a practical standpoint however even problems solvable in cubic or quadratic time

I will speak about some aspects of fair claims resolution, which includes, e.g., resolution by a central authority, by markets autonomous agents , by a fix-point theorem, and even by

Reconnect workshops expose faculty teaching undergraduates to current applications of mathematical and computational sciences and provide an opportunity for government or industry professionals to learn about recent research in related areas The topic will be presented over the course of 3 days in a series of lectures and activities Participants

There are many open questions concerning algorithms related to distance measures that are not given by a norm such as edit distance Ulam distance earth mover distance Wasserstein metric and Frechet distance For each of these measures there are substantial gaps in our understanding of fundamental algorithmic problems such as