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...
