This is intended to be a survey talk, accessible to a general
mathematical audience. The cdh topology was created by Voevodsky to
extend motivic cohomology from smooth varieties to singular
varieties, assuming resolution of singularities (for...
We use critical block sensitivity, a new complexity measure
introduced by Huynh and Nordstrom (STOC 2012) to study the
communication complexity of search problems. Our main result is a
simple proof that if S is a search problem with high
critical...
In this lecture, Quentin Skinner, Barber Beaumont Professor of
the Humanities at Queen Mary University of London, will discuss the
concept of individual freedom, arguing that the usual practice of
defining it in negative terms as “absence of...
In this talk, Jennifer Chayes, Distinguished
Scientist and Managing Director of Microsoft Research New England
and New York City, looks quite generally at some of the models we
are using to describe networks, processes we are studying on
the...
