Organizers: Laszlo Lovasz, Balazs Szegedy, Kati Vesztergombi and Avi Wigderson
One of the unexpecting emerging interactions between seemingly
distant areas in mathematics is between graph theory and analysis.
One such link is the theory of continuous limits of discrete
structures. This theory has applications in computer...
One powerful theme in complexity theory and pseudorandomness in
the past few decades has been the use of lower bounds to give
pseudorandom generators (PRGs). However, the general results using
this hardness vs. randomness paradigm suffer a...
One morning an office worker starts to read aloud a copy of
The Great Gatsby he finds in the clutter on his desk. At
first his coworkers hardly notice, but after a series of
coincidences, it’s no longer clear whether he’s reading the book or
the...
