![School of Mathematics Event](/sites/default/files/styles/two_column_medium/public/2019-09/sm_default.jpg?itok=gMvWynkh)
Computer Science/Discrete Mathematics Seminar I
Computational Hardness From Gaussian Isoperimetry: On Hardness of Graph Coloring, the Shape of Double Bubbles and Related Problems
Date & Time
April 10, 2006 | 11:15am – 12:15pm
Location
S-101Speakers
Elchanan Mossel
Affiliation
University of California, Berkeley