In this talk we will discuss information complexity -- a measure
of the amount of information Alice and Bob need to exchange to
solve a problem over distributed inputs. We will present an
information-theoretically optimal protocol for computing the...
The Ginzburg-Landau theory was first developed to explain
magnetic and other properties of superconductors, but had a
profound influence on physics well beyond its original area. It had
the first demonstration of the Higgs mechanism and it...
For an abelian surface A over a number field k, we study the
limiting distribution of the normalized Euler factors of the
L-function of A. Under the generalized Sato-Tate conjecture, this
is equal to the distribution of characteristic...
Some important mechanisms considered in game theory require
solving optimization problems that are computationally hard.
Solving these problems approximately may not help, as it may change
the players’ rational behavior in the original mechanisms...
This talk is designed for a general mathematical audience; no
prior knowledge of type theory is presumed.
One of the main goals for the special year on univalent foundations
is the development of a logical formalism, called homotopy type
theory...
Polynomial Identity Testing (PIT) is the problem of identifying
whether a given algebraic circuit computes the identically zero
polynomial. It is well-known that this problem can be solved with
small error probability by testing whether the circuit...
