skip to content
 

Quantitative geometry and efficient classification procedures

Presented by: 
A Naor [Courant Institute]
Date: 
Wednesday 15th June 2011 - 17:00 to 17:50
Venue: 
INI Seminar Room 1
Abstract: 
This talk will illustrate to non-experts the use of geometric methods to design efficient partitioning algorithms for discrete objects or, in some cases, to prove that such algorithms must fail to perform well. These connections show that combinatorial optimization problems are intimately related to classical questions in continuous geometry, and we will describe some recent progress on old questions that translates to the best known results on algorithmic problems of central interest. This talk will provide an introduction to geometric aspects of computational complexity via an examination of specific examples. No specialized background will be required.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons