BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251227T191514EST-2719cDlXSr@132.216.98.100
DTSTAMP:20251228T001514Z
DESCRIPTION:The Garden-Hose Model\n\nCafé et biscuits à partir de 15 h.\n	\n
 	In 2011 Harry Buhrman\, Serge Fehr\, Christian Schaffner and Florian Speel
 man proposed a new measure of complexity for finite Boolean functions\, ca
 lled 'The Garden-hose complexity'. This measure can be viewed as a type of
  distributed space complexity where two players with private inputs comput
 e a Boolean function co-operatively. While its motivation is mainly in app
 lications to position based quantum cryptography\, the playful definition 
 of the model is quite appealing in itself.Recently there has been some wor
 k proving non-trivial upper bounds for functions like Equality\, Majority\
 , etc.\, in this model and establishing new connections of this model with
  well studied models like communication complexity\, permutation branching
  programs\, and formula size.In this talk we will discuss these results an
 d look at potential directions for future research.\n
DTSTART:20181122T203000Z
DTEND:20181122T213000Z
LOCATION:Room 3195\, CA\, Pav. André-Aisenstadt
SUMMARY:Supartha Podde (Université d'Ottawa)
URL:/mathstat/channels/event/supartha-podde-universite
 -dottawa-291802
END:VEVENT
END:VCALENDAR