BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quantitative geometry and efficient classification procedures - Na
 or\, A (Courant Institute)
DTSTART:20110615T160000Z
DTEND:20110615T165000Z
UID:TALK31740@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:This talk will illustrate to non-experts the use of geometric 
 methods to design efficient partitioning algorithms for discrete objects o
 r\, in some cases\, to prove that such algorithms must fail to perform wel
 l. These connections show that combinatorial optimization problems are int
 imately related to classical questions in continuous geometry\, and we wil
 l describe some recent progress on old questions that translates to the be
 st known results on algorithmic problems of central interest. This talk wi
 ll provide an introduction to geometric aspects of computational complexit
 y via an examination of specific examples.  No specialized background will
  be required.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR