BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Valiants Shift problem: A reduction to a problem about graph guess
 ing games - Riis\, S (Queen Mary\, University of London)
DTSTART:20120509T130000Z
DTEND:20120509T140000Z
UID:TALK38206@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:The talk will survey a number of results that were partly deve
 loped during my visit at the Newton Institute. I will show that Valiant's 
 Shift problem/conjecture - which has been open for more than 30 years - na
 turally reduce to questions about guessing games.  In the talk I will also
  provide a new perspective on information bottlenecks in Boolean Circuits/
 Communication Networks.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR